A Fast Modular Multiplication Based on RNS
碩士 === 逢甲大學 === 資訊工程學系 === 88 === Many cryptography algorithms and protocols rely on fast calculation of modular exponentiation. RSA algorithm is one example. Modular exponentiation calculation is usually based on modular multiplication. On the field of modular multiplication, Montgomery''...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/30246037962364624340 |