17 search results - page 2 / 4 » Fast Parallel Exponentiation Algorithm for RSA Public-Key Cr... |
CHES
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
IPL
1998
13 years 4 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
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...
AINA
2003
IEEE
13 years 10 months ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...