Comparison of Three Modular Reduction Functions

Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgomery’s algorithm. These algorithms are a time critical step in the implementation of the modular exponentiation operation. For each of these algorithms their application in the modular exponentiation operation is considered. Modular exponentiation constitutes the basis of many well known and widely used public key cryptosystems. A fast and portable modular exponentiation will considerably enhance the speed and applicability of these systems.

• Type: Conference
• Year: 1993
• Where: CRYPTO
• Authors: Antoon Bosselaers, René Govaerts, Joos Vandewalle
• Keywords: CRYPTO 1993, Cryptology, Modular Exponentiation, Modular Exponentiation Operation, Modular Reduction Algorithms