Improved routing-based linear algebra for the number field sieve

International Conference on Information Technology: Coding and Computing, ITCC

Volumn 1, Issue , 2005, Pages 636-641

  Geiselmann, Willi ^a   Köpfer, Hubert ^a   Steinwandt, Rainer ^a   Tromer, Eran ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; LINEAR ALGEBRA; TOPOLOGY;

NUMBER FIELD SIEVE INTEGER FACTORING ALGORITHM; PACKET INJECTION; ROUTING ALGORITHM; ROUTING-BASED LINEAR ALGEBRA;

MATHEMATICAL TECHNIQUES;

EID: 24744433969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itcc.2005.173     Document Type: Conference Paper

References (12)

1. D. J. Bernstein. Circuits for Integer Factorization: a Proposal. Available at http://cr.yp.to/papers/ nfscircuit.pdf, 2001.
2. D. Coppersmith. Solving Homogeneous Linear Equations over GF(2) via Block Wiedemann Algorithm. Mathematics of Computation, 62(205):333-350, 1994.
3. W. Geiselmann and R. Steinwandt. A Dedicated Sieving Hardware. In Public Key Cryptography - PKC 2003, volume 2567 of LNCS, pages 254-266. Springer, 2003.
4. W. Geiselmann and R. Steinwandt. Hardware for Solving Sparse Systems of Linear Equations over GF(2). In Cryptographic Hardware and Embedded Systems - CHES 2003, volume 2779 of LNCS, pages 51-61. Springer, 2003.
5. W. Geiselmann and R. Steinwandt. Yet Another Sieving Device. In Topics in Cryptology - CT-RSA 2004, volume 2964 of LNCS, pages 278-291. Springer, 2004.
6. A. K. Lenstra and H. W. L. Jr., editors. The development of the number field sieve, volume 1554 of LNCS. Springer, 1993.
7. A. K. Lenstra and A. Shamir. Analysis and Optimization of the TWINKLE Factoring Device. In Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 35-52. Springer, 2000.
8. A. K. Lenstra, A. Shamir, J. Tomlinson, and E. Tromer. Analysis of Bernstein's Factorization Circuit. In Advances in Cryptology - ASIACRYPT 2002, volume 2501 of LNCS, pages 1-26. Springer, 2002.
9. A. K. Lenstra, E. Tromer, A. Shamir, W. Kortsmit, B. Dodson, J. Hughes, and P. C. Leyland. Factoring Estimates for a 1024-Bit RSA Modulus. In Advances in Cryptology - ASIACRYPT 2003, volume 2894 of LNCS, pages 55-74. Springer, 2003.
10. A. Shamir. Factoring Large Numbers with the TWINKLE Device. In Cryptographic Hardware and Embedded Systems. First International Workshop, CHES'99, volume 1717 of LNCS, pages 2-12. Springer, 1999.
11. A. Shamir and E. Tromer. Factoring Large Numbers with the TWIRL Device. In Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 1-26. Springer, 2003.
12. D. H. Wiedemann. Solving Sparse Linear Equations Over Finite Fields. IEEE Transactions on Information Theory, 32(1):54-62, 1986.