Factoring large numbers with the TWIRL device

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2729, Issue , 2003, Pages 1-26

  Shamir, Adi ^a   Tromer, Eran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; CRYPTOGRAPHY; LOGIC DEVICES;

COST EFFECTIVE; CRITICAL COMPONENT; HARDWARE IMPLEMENTATIONS; LARGE DISTRIBUTED COMPUTATION; NUMBER FIELD SIEVE; ORDERS OF MAGNITUDE; RSA CRYPTOSYSTEMS; VLSI TECHNOLOGY;

HARDWARE;

EID: 35248849882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_1     Document Type: Article

References (22)

1. ∼zimmerma/records/rsa160
2. Daniel J. Bernstein, How to find small factors of integers, manuscript, 2000, http://cr.yp.to/papers.html
3. Daniel J. Bernstein, Circuits for integer factorization: a proposal, manuscript, 2001, http://cr.yp.to/papers.html
4. Richard P. Brent, Recent progress and prospects for integer factorisation algorithms, proc. COCOON 2000, LNCS 1858 3-22, Springer-Verlag, 2000
5. S. Cavallar, B. Dodson, A.K. Lenstra, W. Lioen, P.L. Montgomery, B. Murphy, H.J.J. te Riele, et al., Factorization of a 512-bit RSA modulus, proc. Eurocrypt 2000, LNCS 1807 1-17, Springer-Verlag, 2000
6. Don Coppersmith, Modifications to the number field sieve, Journal of Cryptology 6 169-180, 1993
7. Willi Geiselmann, Rainer Steinwandt, A dedicated sieving hardware, proc. PKC 2003, LNCS 2567 254-266, Springer-Verlag, 2002
8. Willi Geiselmann, Rainer Steinwandt, Hardware to solve sparse systems of linear equations over GF(2), proc. CHES 2003, LNCS, Springer-Verlag, to be published.
9. International Technology Roadmap for Semiconductors 2001, http://public.itrs.net/
10. Hea Joung Kim, William H. Magione-Smith, Factoring large numbers with programmable hardware, proc. FPGA 2000, ACM, 2000
11. Robert Lambert, Computational aspects of discrete logarithms, Ph.D. Thesis, University of Waterloo, 1996
12. Arjen K. Lenstra, H.W. Lenstra, Jr., (eds.), The development of the number field sieve, Lecture Notes in Math. 1554, Springer-Verlag, 1993
13. Arjen K. Lenstra, Bruce Dodson, NFS with four large primes: an explosive experiment, proc. Crypto '95, LNCS 963 372-385, Springer-Verlag, 1995
14. Arjen K. Lenstra, Bruce Dodson, James Hughes, Paul Leyland, Factoring estimates for 1024-bit RSA modulus, to be published.
15. Arjen K. Lenstra, Adi Shamir, Analysis and Optimization of the TWINKLE Factoring Device, proc. Eurocrypt 2002, LNCS 1807 35-52, Springer-Verlag, 2000
16. Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, Eran Tromer, Analysis of Bernstein's factorization circuit, proc. Asiacrypt 2002, LNCS 2501 1-26, Springer-Verlag, 2002
17. Brian Murphy, Polynomial selection for the number field sieve integer factorization algorithm, Ph. D. thesis, Australian National University, 1999
18. National Institute of Standards and Technology, Key management guidelines, Part 1: General guidance (draft), Jan. 2003, http://csrc.nist.gov/CryptoToolkit/tkkeymgmt.html
19. Adi Shamir, Factoring large numbers with the TWINKLE device (extended abstract), proc. CHES'99, LNCS 1717 2-12, Springer-Verlag, 1999
20. RSA Security, The new RSA factoring challenge, web page, Jan. 2003, http://www.rsasecurity.com/rsalabs/challenges/factoring/
21. Robert D. Silverman, A cost-based security analysis of symmetric and asymmetric key lengths, Bulletin 13, RSA Security, 2000, http://www.rsasecurity.com/rsalabs/bulletins/bulletin13.html
22. ∼tromer/twirl