4 search results - page 1 / 1 » CAIRN 2: An FPGA Implementation of the Sieving Step in the N... |
CHES
2007
Springer
13 years 10 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
CHES
2006
Springer
13 years 8 months ago
2006
Springer
A novel portable hardware architecture of the Elliptic Curve Method of factoring, designed and optimized for application in the relation collection step of the Number Field Sieve,...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
FCCM
2005
IEEE
13 years 10 months ago
2005
IEEE
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 ...