A Block Lanczos Algorithm for Finding Dependencies over GF(2)
Some integer factorization algorithms require several vectors in the null space of a sparse m × n matrix over the field GF(2). We modify the Lanczos algorithm to produce a sequence of orthogonal subspaces of GF(2)n, each having dimension almost N, where N is the computer word size, by applying the given matrix and its transpose to N binary vectors at once. The resulting algorithm takes about n/(N − 0.76) iterations. It was applied to matrices larger than 106 × 106 during the factorizations of 105-digit and 119-digit numbers via the general number field sieve.
- 1.Henk Boender, Private communication, 1994.Google Scholar
- 4.Scott Contini and Arjen K. Lenstra, Implementation of blocked Lanczos and Wiedemann algorithms, In preparation, 1995.Google Scholar
- 9.Donald E. Knuth, Seminumerical algorithms, The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, MA, 2nd ed., 1981.Google Scholar
- 10.B.A. LaMacchia and A.M. Odlyzko, Solving large sparse systems over finite fields, Advances in Cryptology, CRYPTO’ 90 (A.J. Menezes and S.A. Vanstone, eds.), Lecture Notes in Computer Science, vol. 537, Springer-Verlag, pp. 109–133.Google Scholar
- 12.A.M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proceedings of EUROCRYPT 84 (New York) (T. Beth, N. Cot, and I. Ingemarsson, eds.), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, pp. 224–314.Google Scholar
- 13.Carl Pomerance, The quadratic sieve factoring algorithm, Advances in Cryptology, Proceedings of EUROCRYPT 84 (New York) (T. Beth, N. Cot, and I. Ingemarsson, eds.), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, pp. 169–182.Google Scholar