610 search results - page 1 / 122 » Fast Modular Reduction |
CRYPTO
1993
Springer
13 years 9 months ago
1993
Springer
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
ARITH
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
ASIACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...