A block Lanczos algorithm for finding dependencies over GF(2)

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

Volumn 921, Issue , 1995, Pages 106-120

  Montgomery, Peter L ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FACTORIZATION; MATRIX ALGEBRA; VECTOR SPACES;

BINARY VECTORS; BLOCK LANCZOS ALGORITHM; INTEGER FACTORIZATION; LANCZOS ALGORITHM; N-MATRIX; NULL SPACE; NUMBER FIELD SIEVE; ORTHOGONAL SUBSPACES;

ALGORITHMS;

EID: 84957682846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49264-X_9     Document Type: Conference Paper

References (15)

1. Henk Boender, Private communication, 1994.
2. Richard P. Brent and Brendan D. McKay, On determinants of random symmetric matrices over Z,, Ars Combinatoria 26A (1988), 57-64.
3. J.P. Buhler, H.W. Lenstra Jr.., and Carl Pomerance, Factoring integers with the number field sieve, The Development of the Number Field Sieve (Berlin) (A.K. Lenstra and H.W. Lenstra, Jr., eds.), Lecture Notes in Mathematics, vol. 1554, Springer-Verlag, Berlin, 1993, pp. 50-94.
4. Scott Contini and Arjen K. Lenstra, Implementation of blocked Lanczos and Wiedemann algorithms, In preparation, 1995.
5. Don Coppersmith, Solving linear equations over GF(2): Block Lanczos algorithm, Linear Algebra and its Applications 192 (1993), 33-60.
6. Don Coppersmith Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Mathematics of Computation 62 (1994), no. 205, 333-350.
7. Don Coppersmith, Andrew M. Odlyako, and Richard Schroeppel, Discrete logarithms in GF(p), Algorithmica 1 (1986), 1-15.
8. Jane K. Cullum and Ralph A. Willoughby, Lanczos algorithms for large symmetric eigenvalue computations. Vol. I Theory, Birkhauser, Boston, 1985.
9. Donald E. Knuth, Seminumerical algorithms, The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, MA, 2nd ed., 1981.
10. B.A. LaMacchia and A.M. Odlyzko, Solving large sparse systems over finite fields, Advances in Cryptology, CRYPT0 '90 (A.J. Menezes and S.A. Vanstone, eds.), Lecture Notes in Computer Science, vol. 537, Springer-Verlag, pp. 109-133.
11. A.K. Lenstra, H.W. Lenstra Jr., M.S. Manasse, and J.M. Pollard, The factorization ofthe ninth Fermat number, Mathematics of Computation 61 (1993), no. 203.
12. A.M. Odlyzko, Discrete logarithms an 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.
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.
14. Robert D. Silverman, The multiple polynomial quadratic sieve, Mathematics of Computation 48 (1987), no. 177, 329-339.
15. Douglas H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory 32 (1986), no. 1, 54-62.