Modular Multiplication Algorithm in Cryptographic Processor: A Review and Future Directions

The strength of public-key cryptography depends on the degree of difficulty of a private key to be determined from its corresponding public key. Such a Key can be generated from computationally high radix arithmetic operations like modular exponentiation with very large integer values. To perform this modular exponentiation, different multiplication algorithms like Montgomery algorithm, Karatsuba algorithm, VLM3 algorithm are used. In this Paper, those algorithms results are analyzed and their performance towards measure of algorithm complexity, critical path delay, area, time period and frequency are compared. Keyword: High-speed and high-radix arithmetic; Modular exponentiation and multiplication; Montgomery algorithm; Karatsuba algorithm; VLM3 algorithm.