Sciweavers

7 search results - page 2 / 2
» Moduli for Testing Implementations of the RSA Cryptosystem
Sort
View
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
13 years 9 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
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...
Marc Joye, Pascal Paillier
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
13 years 11 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...