Sciweavers

20 search results - page 1 / 4
» Factorization of a 512-Bit RSA Modulus
Sort
View
EUROCRYPT
2000
Springer
13 years 8 months ago
Factorization of a 512-Bit RSA Modulus
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra,...
ACSAC
2000
IEEE
13 years 9 months ago
The Chinese Remainder Theorem and its Application in a High-Speed RSA Crypto Chip
The performance of RSA hardware is primarily determined by an efficient implementation of the long integer modular arithmetic and the ability to utilize the Chinese Remainder The...
Johann Großschädl
ASIACRYPT
2003
Springer
13 years 10 months ago
Factoring Estimates for a 1024-Bit RSA Modulus
We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17...
Arjen K. Lenstra, Eran Tromer, Adi Shamir, Wil Kor...
ACNS
2007
Springer
172views Cryptology» more  ACNS 2007»
13 years 11 months ago
Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...
Hung-Min Sun, Mu-En Wu, Yao-Hsin Chen
AFRICACRYPT
2010
Springer
13 years 10 months ago
Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits
Subhamoy Maitra, Santanu Sarkar, Sourav Sen Gupta