The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation
Information Processing Letters
Complexity and Fast Algorithms for Multiexponentiations
IEEE Transactions on Computers
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computer Arithmetic Algorithms
Computer Arithmetic Algorithms
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
Signed Digit Representations of Minimal Hamming Weight
IEEE Transactions on Computers
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Carry propagation in signed digit representations
European Journal of Combinatorics
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm
IEEE Transactions on Computers
| Hi-index | 0.00 |
Modular arithmetic plays very crucial role for public key cryptosystems, such as the public key cryptosystem, the key distribution scheme, and the key exchange scheme. Modular exponentiation is a common operation used by several public-key cryptosystems, such as the RSA encryption scheme and the Diffie-Hellman key exchange scheme. In this paper, we have proposed a new method to fast evaluate modular exponentiation, which combines the complement recoding method and canonical recoding technique.