A fast modular multiplication algorithm

Abstract

Most public-key cryptosystems are constructed based on a modular exponentiation, which must be further decomposed into a series of modular multiplications. Therefore, modular multiplication must be speeded up. A new modular multiplication algorithm is proposed. The algorithm reduces the execution time by 66% compared with conventional ones by spending the same amount of hardware.

Keywords:

• Modular multiplication
• modular exponentiation
• public-key cryptosystem
• cryptography
• parallel processing

C.R. Categories:

• E.3
• D4.6