Scalable hardware for sparse systems of linear equations, with applications to integer factorization

Lecture Notes in Computer Science

Volumn 3659, Issue , 2005, Pages 131-146

  Geiselmann, Willi ^a   Shamir, Adi ^b   Steinwandt, Rainer ^a,c   Tromer, Eran ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c FLORIDA ATLANTIC UNIVERSITY   (United States)

Author keywords

Factorization; Number field sieve; Sparse systems of linear equations

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; ERROR ANALYSIS; INTEGER PROGRAMMING; INTERCONNECTION NETWORKS; LINEAR ALGEBRA; LINEAR EQUATIONS; NUMBER THEORY; PROBABILITY; PROBLEM SOLVING; SYSTEMS ANALYSIS;

COMPUTATIONAL ERRORS; FACTORIZATION; NUMBER FIELD SIEVE; SPARSE SYSTEMS OF LINEAR EQUATIONS;

COMPUTER HARDWARE;

EID: 27244438449     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11545262_10     Document Type: Conference Paper

References (18)

1. Shamir, A.: Factoring Large Numbers with the TWINKLE Device. In: CHES 1999. Volume 1717 of LNCS, Springer (1999) 2-12
2. Lenstra, A.K., Shamir, A.: Analysis and Optimization of the TWINKLE Factoring Device. In: EUROCRYPT 2000. Volume 1807 of LNCS, Springer (2000) 35-52
3. Geiselmann, W., Steinwandt, R.: A Dedicated Sieving Hardware. In: PKC 2003. Volume 2567 of LNCS, Springer (2003) 254-266
4. Shamir, A., Tromer, E.: Factoring Large Numbers with the TWIRL Device. In: CRYPTO 2003. Volume 2729 of LNCS, Springer (2003) 1-26
5. Geiselmann, W., Steinwandt, R.: Yet Another Sieving Device. In: CT-RSA 2004. Volume 2964 of LNCS, Springer (2004) 278-291
6. Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C.: SHARK A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers. In: SHARCS 2005. (2005)
7. Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Simka, M., Stahlke, C.: An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method. In: SHARCS 2005. (2005)
8. Bernstein, D.J.: Circuits for Integer Factorization: a Proposal. At the time of writing available electronically at http://cr.yp.to/papers/nfscircuit. pdf (2001)
9. Lenstra, A.K., Shamir, A., Tomlinson, J., Tromer, E.: Analysis of Bernstein's Factorization Circuit. In: ASIACRYPT 2002. Volume 2501 of LNCS, Springer (2002) 1-26
10. Geiselmann, W., Steinwandt, R.: Hardware for Solving Sparse Systems of Linear Equations over GF(2). In: CHES 2003. Volume 2779 of LNCS, Springer (2003) 51-61
11. Geiselmann, W., Köpfer, H., Steinwandt, R., Tromer, E.: Improved Routing-Based Linear Algebra for the Number Field Sieve. In: Proceedings of ITCC '05 - Track on Embedded Cryptographic Systems, IEEE Computer Society (2005) 636-641
12. Frey, G.: A First Step Towards Computations in Brauer Groups and Applications to data Security. Invited talk at WARTACRYPT '04 (2004)
13. Frey, G.: On the Relation between Brauer Groups and Discrete Logarithms. Unpublished manuscript (2004)
14. Pomerance, C.: A Tale of Two Sieves. Notices of the ACM (1996) 1473-1485
15. Lenstra, A.K., Hendrik W. Lenstra, J., eds.: The development of the number field sieve. Volume 1554 of Lecture Notes in Mathematics. Springer (1993)
16. Coppersmith, D.: Solving Homogeneous Linear Equations over GF(2) via Block Wiedemann Algorithm. Mathematics of Computation 62 (1994) 333-350
17. Villard, G.: Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems. In: International Symposium on Symbolic and Algebraic Computation - ISAAC '97, ACM (1997) 32-39
18. Cavallar, S., Dodson, B., Lenstra, A., Lioen, W., Montgomery, P., Murphy, B., te Riele et al., H.: Factorization of a 512-bit RSA modulus. In: EUROCRYPT 2000. Volume 1807 of LNCS, Springer (2000) 1-17