查詢結果分析
來源資料
相關文獻
- Advanced Mathematical and Complexity Analyses for Theories of Cryptographic Algorithms Design on Modern Cryptosystems
- Table-Based Linear Transformation Filters Using Current Conveyors
- Fast Cryptographic Arithmetic Using Parallel Computing Technique and Binary Method
- Efficient Modular Algorithm Design for Modern Cryptosystems and Complexity Analyses on Information Security Applications
- 增強型擾動觀察法之太陽能最大功率追蹤
- 奈米量測系統設計
- 具最簡電路架構的直流馬達查表法控制之電能再生研製
- Low-Complexity Cryptographic Algorithm Design Based on Addition Chain and Signed Recoding Technique
- Advanced Fast Binary Modular Arithmetic Algorithms Design and Number Theory Analyses for Public-Key Cryptosystems
- 新型混合式太陽能發電最大功率追蹤法
頁籤選單縮合
題名 | Advanced Mathematical and Complexity Analyses for Theories of Cryptographic Algorithms Design on Modern Cryptosystems=應用於現代資訊安全領域之密碼學演算複雜度運算分析與技術探討 |
---|---|
作 者 | 吳嘉龍; | 書刊名 | 航空技術學院學報 |
卷期 | 10:1 2011.08[民100.08] |
頁次 | 頁23-31 |
分類號 | 312.76 |
關鍵詞 | 蒙哥馬利演算法; 滑窗法; 查表法; 演算法設計; 現代密碼系統; Montgomery method; Sliding-window; Look-up table; Algorithm design; Modern cryptosystems; |
語文 | 英文(English) |
中文摘要 | 符號元編碼表示法可應用於密碼學、物理學、基因學以及其他許多科學領域,其特性為可以減少非零位元的出現,利用此一優點,我們得以有效的減少在模指數運算過程中的冗餘模乘運算量。有效的模指數運算演算法,在密碼學研究領域,尤其是公開金鑰密碼系統應用上有相當重要的地位。在結合查表法、滑窗演算法技術與蒙哥馬利演算法,當將符號元編碼的指數部份作平行運算,並且運用對摺指數部份加以記錄共同乘法的部份時,可以藉由改進二元掃瞄演算法與共同被乘數演算法,進而更加地減少模指數運算的計算複雜度。本篇論文描述現代演算法,舉出範例說明,並深入探討符號元編碼指數演算法,滑窗演算法技術法,蒙哥馬利演算法以及計點編碼表示法。若配合蒙哥馬利法與高根位元編碼等先進演算技術,將指數部份加以記錄共同乘法部份的理論基礎與研究並比較其他演算法的複雜度分析,我們可以有效降低模指數運算的整體計算複雜度,研究得到現代密碼系統更佳加速運算結果。 |
英文摘要 | Modular arithmetic plays a crucial part in modern public-key cryptography. In this paper, several efficient modular arithmetic algorithms using in modern public-key cryptosystems are discussed and analyzed, especially which based on the common-multiplicand-multiplication and signed-digit-folding techniques. Taking this advantage from those techniques, we can effectively decrease the amount of modular multiplications. By dividing the bit string of the minimal-signed-digit recoding exponent and using the technique of recording the common parts in the folded substrings, the “folding-exponent algorithm” can improve the efficiency of the binary algorithm. We know modular arithmetic is the most dominant part of the computation which is performed in the cryptosystems system. The operation is time-consuming for large operands. In this paper, we describe the modular arithmetic and some improved algorithms. These algorithms in the modular arithmetic are signed-digit recoding method, addition chain method, and Montgomery algorithm and so on. Some improved algorithms will be depicted respectively such as dot counting method, complement recoding method, and sliding window method. We will depict the computational complexities and theories for the algorithm of the described methods. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。