Sciweavers

4 search results - page 1 / 1
» SHARK: A Realizable Special Hardware Sieving Device for Fact...
Sort
View
CHES
2005
Springer
91views Cryptology» more  CHES 2005»
13 years 10 months ago
SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers
Jens Franke, Thorsten Kleinjung, Christof Paar, Ja...
ASIACRYPT
2003
Springer
13 years 9 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»
13 years 10 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...
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
13 years 10 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 ...