Using a grid platform for solving large sparse linear systems over GF(2)

Proceedings - IEEE/ACM International Workshop on Grid Computing

Volumn , Issue , 2010, Pages 161-168

  Kleinjung, Thorsten ^a   Nussbaum, Lucas ^b   Thomé, Emmanuel ^c  

^a EPFL   (Switzerland)

^b LORIA   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; LINEAR SYSTEMS;

BINARY FIELDS; ERROR DETECTION AND RECOVERY; GRID PLATFORM; INTEGER FACTORIZATION; LARGE SPARSE LINEAR SYSTEMS; SPARSE LINEAR SYSTEMS;

GRID COMPUTING;

EID: 79951608631     PISSN: 15505510     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRID.2010.5697952     Document Type: Conference Paper

References (15)

1. T. Kleinjung, K. Aoki, J. Franke, A. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. Montgomery, D. A. Osvik, H. te Riele, A. Timofeev, and P. Zimmermann, "Factorization of a 768-bit rsa modulus," in CRYPTO 2010, ser. Lecture Notes in Comput. Sci. Springer-Verlag, 2010, accepted for publication.
2. A. K. Lenstra and H. W. Lenstra, Jr., Eds., The development of the number field sieve, ser. Lecture Notes in Math., vol. 1554. Springer-Verlag, 1993.
3. M. Mohiyuddin, M. Hoemmen, J. Demmel, and K. Yelick, "Minimizing communication in sparse matrix solvers," in SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis. ACM, 2009.
4. M. A. Morrison and J. Brillhart, "A method of factoring and the factorization of F7," Math. Comp., vol. 29, no. 129, pp. 183-205, Jan. 1975.
5. C. Pomerance, "The quadratic sieve algorithm," in EUROCRYPT '84, ser. Lecture Notes in Comput. Sci., T. Beth, N. Cot, and I. Ingemarsson, Eds., vol. 209. Springer-Verlag, 1985, pp. 169-182.
6. L. M. Adleman, "A subexponential algorithm for the discrete logarithm problem with applications to cryptography," in 20th Annual Symposium on Foundations of Computer Science (FOCS '79). IEEE Computer Society Press, 1979, pp. 55-60.
7. D. Coppersmith, "Fast evaluation of logarithms in fields of characteristic two," IEEE Trans. Inform. Theory, vol. IT-30, no. 4, pp. 587-594, Jul. 1984. (Pubitemid 14632101)
8. B. A. LaMacchia and A. M. Odlyzko, "Solving large sparse linear systems over finite fields," in CRYPTO '90, ser. Lecture Notes in Comput. Sci., A. J. Menezes and S. A. Vanstone, Eds., vol. 537. Springer-Verlag, 1990, pp. 109-133.
9. P. L. Montgomery, "A block Lanczos algorithm for finding dependencies over GF(2)," in EUROCRYPT '95, ser. Lecture Notes in Comput. Sci., L. C. Guillou and J.-J. Quisquater, Eds., vol. 921, 1995, pp. 106-120.
10. D. Coppersmith, "Solving linear equations over GF(2) via block Wiedemann algorithm," Math. Comp., vol. 62, no. 205, pp. 333-350, Jan. 1994.
11. K. Aoki, J. Franke, T. Kleinjung, A. K. Lenstra, and D. Osvik, "A kilobit special number field sieve factorization," in ASIACRYPT'2007, ser. Lecture Notes in Comput. Sci., vol. 4833. Springer-Verlag, 2007, pp. 1-12.
12. E. Thomé, "Computation of discrete logarithms in F2607 ," in ASIACRYPT 2001, ser. Lecture Notes in Comput. Sci., C. Boyd and E. Dawson, Eds., vol. 2248. Springer-Verlag, 2001, pp. 107-124.
13. D. H. Wiedemann, "Solving sparse linear equations over finite fields," IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 54-62, Jan. 1986.
14. E. Kaltofen and A. Lobo, "Distributed matrix-free solution of large sparse linear systems over finite fields," Algorithmica, vol. 24, no. 4, pp. 331-348, 1999. (Pubitemid 129597271)
15. E. Thomé, "Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm," J. Symbolic Comput., vol. 33, no. 5, pp. 757-775, Jul. 2002.