English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41644923      線上人數 : 1220
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/8526


    題名: 實體密碼攻擊法之研究
    作者: 楊舜民;Shen-Ming Yang
    貢獻者: 資訊工程研究所
    關鍵詞: 時序攻擊法;錯誤攻擊法;實體密碼攻擊法;能量攻擊法;timing attack;fault-based attack;physical cryptanalysis;power monitoring attack
    日期: 2001-06-29
    上傳時間: 2009-09-22 11:29:21 (UTC+8)
    出版者: 國立中央大學圖書館
    摘要: 在現今科技進步的時代,如Smart Card, PDA等等有效率且精密的電子設備紛紛被研發,並用以輔助使用者處理或儲存個人的秘密資料。然而,此類電子設備通常操作在公開的環境中,因此極有可能在某些條件之下,而洩漏秘密資料,進而危及個人權益。 而在近幾年,實體密碼攻擊法(physical cryptanalysis)已經在密碼學中自成一門新興的領域。現存的各類密碼演算法,經常被設計成硬體或軟體,一旦在設計時,考慮不周詳,即可能遭到實體密碼攻擊法的攻擊。在本篇論文中,實體密碼攻擊法將被仔細的討論,且將特別針對錯誤攻擊法(fault-based attack)以及時序攻擊法(timing attack)加以討論。 在第四章,一種新型態錯誤攻擊法被發表,該錯誤攻擊法可以用來分析IDEA, RC5與RC6。該攻擊法主要針對模加法(modular addition)與模乘法(modular multiplication)兩種運算加以分析。正因為這兩種運算被廣泛的使用在傳統加密器中,所以其相對的安全性更需要被仔細的討論。 在傳統設計中,除法鏈演算法(division chain algorithm)是被用來提昇指數運算效率的演算法,正因為其具有良好的效率,所以受到廣泛的重視。隨機亂序除法鏈的觀念在第五章被提出來,該觀念用來防禦現行可能的時序攻擊法,並且相關的執行效率也一併被討論。 混合式攻擊法(Hybrid attacks)基本上是合併兩種以上的實體密碼攻擊法,同時用以分析密碼系統。在某些合理的假設之下,混合式攻擊法將較單一的實體密碼攻擊法更有效率。在第六章,混合式攻擊法以及可行的防禦機制設計觀念將被提出來討論。 Nowadays, some popular and small electronic devices, e.g., smart IC cards, are developed in order to provide possible solutions for data security, such as data processing and storage. However, these devices operate frequently in public environments and may suffer to leak secret information. In this thesis, physical cryptanalysis will be examined with great details. Physical cryptanalysis analyze careless implements of cryptosystems and open a brand new direction of cryptanalysis during the past few years. In this thesis, we focus especially on the fault-based attack and timing attack. In Chapter 4, new fault-based attacks on IDEA and RC5 (and also RC6) ciphers are considered. These attacks are conducted upon either modular addition or modular multiplication. Moreover, these two modular operations are used frequently in many cryptosystems, so their security should be considered extensively. Analysis shows that the considered cryptanalysis in this thesis is reasonable. Division chain algorithm was originally developed for improving exponentiation computation. In Chapter 5, the concept of randomized division chain is proposed to counteract the possible timing cryptanalysis when performing an exponentiation computation. Hybrid attacks, i.e., a novel combination of more than one physical cryptanalysis at the same time, are believed to be much powerful than any single physical cryptanalysis. In Chapter 6, possible guidelines, although not exhaustive, to prevent hybrid attacks are considered.
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 大小格式瀏覽次數


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明