Sciweavers

4 search results - page 1 / 1
» An Evaluation of the Sieving Device YASD for 1024-Bit Intege...
Sort
View
NBIS
2010
Springer
14 years 7 months ago
An Evaluation of the Sieving Device YASD for 1024-Bit Integers
Naoyuki Hirota, Tetsuya Izu, Noboru Kunihiro, Kazu...
CHES
2005
Springer
91views Cryptology» more  CHES 2005»
15 years 3 months ago
SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers
Jens Franke, Thorsten Kleinjung, Christof Paar, Ja...
ASIACRYPT
2003
Springer
15 years 2 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...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
15 years 3 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...