Efficient Computing with Specified RSA Public Modulus
碩士 === 義守大學 === 資訊工程學系 === 103 === In RSA cryptosystem, modular exponentiation is the most time-consuming operation, it can be composed of repetition of modular multiplications. In order to improve the performance of modular exponentiation, it is usually using Montgomery multiplication. Montgomery...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53036397517949676263 |