Study of Montgomery Inverse Generation
碩士 === 義守大學 === 資訊工程學系碩士班 === 99 === In public key cryptosystem, Montgomery multiplication is an efficient algorithm to evaluate modular multiplication. In addition, modular inverse arithmetic plays an important role in elliptic curve cryptography (ECC). Therefore, using efficient modular inverse al...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06674833199752512057 |
| Summary: | 碩士 === 義守大學 === 資訊工程學系碩士班 === 99 === In public key cryptosystem, Montgomery multiplication is an efficient algorithm to evaluate modular multiplication. In addition, modular inverse arithmetic plays an important role in elliptic curve cryptography (ECC). Therefore, using efficient modular inverse algorithm is a key point of ECC. In this thesis, we analyze several Montgomery multiplication algorithms. Finally, we discuss the characteristics of these Montgomery modular inverse algorithms and the traditional modular inverse algorithm.
|
|---|