Comparison of Three Modular Reduction Functions

Authors:
Antoon Bosselaers;René Govaerts;Joos Vandewalle
Affiliations:
-;-;-
Venue:
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Year:
1993

Citing 3
Cited 1

Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
A cryptographic library for the Motorola DSP56000

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Faster Modular Multiplication by Operand Scaling

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

A hardware version of the RSA using the Montgomery's algorithm with systolic arrays

Integration, the VLSI Journal

Quantified Score

Hi-index	0.08

Visualization

Abstract

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.