90 search results - page 1 / 18 » Fast implementations of RSA cryptography |
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
CHES
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
CHES
2003
Springer
14 years 5 days ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
CHES
2006
Springer
13 years 10 months ago
2006
Springer
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
DATE
2003
IEEE
14 years 7 days ago
2003
IEEE
In this paper we present an hardware implementation of the RSA algorithm for public-key cryptography. The RSA algorithm consists in the computation of modular exponentials on larg...