查詢結果分析
來源資料
相關文獻
- Fast Montgomery Algorithm Design and Number Theoretical Complexity Analyses for Computer Security
- Modular Multiplication Algorithm Design and Theoretical Number Theory Analyses for RSA Public-Key Cryptosystems
- Efficient Modular Algorithm Design for Modern Cryptosystems and Complexity Analyses on Information Security Applications
- Fast Modular Exponentiation and Number Theoretical Complexity Information Analyses for Public-Key Cryptosystems
- Low-Complexity Cryptographic Algorithm Design Based on Addition Chain and Signed Recoding Technique
- Efficient Modular Arithmetic Algorithm Design for RSA Cryptosystems and Area-Time Complexity Analyses
- Redundancy Elimination and Number Theory Computing Techniques on Information Security Applications
- 設計一個基因演算法以密文攻擊方式破解Vigenere密碼
- 基因演算法於密碼學之應用與研究
- 安全電子信件技術介紹
頁籤選單縮合
題名 | Fast Montgomery Algorithm Design and Number Theoretical Complexity Analyses for Computer Security=針對蒙哥馬利演算法設計應用與運算複雜度數論發展研究剖析 |
---|---|
作者 | 吳嘉龍; | 書刊名 | 航空技術學院學報 |
卷期 | 11:1 2012.08[民101.08] |
頁次 | 頁35-43 |
分類號 | 312.76 |
關鍵詞 | 蒙哥馬利法; 符號元編碼; 演算法; 密碼系統; 數論分析; Montgomery method; Signed-digit recoding; Algorithm; Cryptosystem; Numerical analysis; |
語文 | 英文(English) |