Abstract
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can be solved efficiently by using combinations of structured Gaussian elimination and the conjugate gradient, Lanczos, and Wiedemann methods.
Chapter PDF
References
G. S. Ammar and W. G. Gragg, Superfast solution of real positive definite Toeplitz systems, SIAM J. Matrix Anal. Appl., 9 (1988), 61–76.
R. R. Bitmead and B. D. O. Anderson, Asymptotically fast solution of Toeplitz and related systems of linear equations, Lin. Alg. Appl. 34 (1980), 103–116.
I. F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone, Computing logarithms in fields of characteristic two, SIAM J. Alg. Disc. Methods 5 (1984), 276–285.
R. P. Brent, F. G. Gustavson, and D. Y. Y. Yun, Fast solution of Toeplitz systems of equations and computation of Padé approximants, J. Algorithms 1 (1980), 259–295.
D. Coppersmith, Fast evaluation of discrete logarithms in fields of characteristic two, IEEE Trans. on Information Theory 30 (1984), 587–594.
D. Coppersmith and J. H. Davenport, An application of factoring, J. Symbolic Computation 1 (1985), 241–243.
D. Coppersmith, A. Odlyzko, and R. Schroeppel, Discrete logarithms in GF(p), Algorithmica 1 (1986), 1–15.
D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proc. 19th ACM Symp. Theory Comp. (1987), 1–6.
M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, J. Res. Nat. Bureau of Standards 49 (1952), 409–436.
B. A. LaMacchia and A. M. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes, and Cryptography 1 (1991), to appear.
C. Lanczos, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bureau of Standards 49 (1952), 33–53.
A. K. Lenstra and M. S. Manasse, Factoring by electronic mail, Advances in Cryptology: Proceedings of Eurocrypt’ 89, J.-J. Quisquater, ed., to be published.
A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Advances in Cryptology: Proceedings of Eurocrypt’ 90, I. Damgard, ed., to be published.
K. S. McCurley, The discrete logarithm problem, in Cryptography and Computational Number Theory, C. Pomerance, ed., Proc. Symp. Appl. Math., Amer. Math. Soc., 1990, to appear.
J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Information Theory IT-15 (1969), 122–127.
W. H. Mills, Continued fractions and linear recurrences, Math. Comp. 29 (1975), 173–180.
A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proceedings of Eurocrypt’ 84, T. Beth, N. Cot, I. Ingemarsson, eds., Lecture Notes in Computer Science 209, Springer-Verlag, NY (1985), 224–314.
C. Pomerance, Analysis and comparison of some integer factoring algorithms, Computational Methods in Number Theory: Part I, H. W. Lenstra, Jr., and R. Tijdeman, eds., Math. Centre Tract 154 (1982), Math. Centre Amsterdam, 89–139.
C. Pomerance, Factoring, in Cryptography and Computational Number Theory, C. Pomerance, ed., Proc. Symp. Appl. Math., Amer. Math. Soc., 1990, to appear.
C. Pomerance and J. W. Smith, Reduction of large, sparse matrices over a finite field via created catastrophes, manuscript in preparation.
V. Strassen, Gaussian elimination is not optimal, Numerische Math. 13 (1969), 354–356.
D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Information Theory IT-32 (1986), 54–62.
J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford Univ. Press, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
LaMacchia, B.A., Odlyzko, A.M. (1991). Solving Large Sparse Linear Systems Over Finite Fields. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive