Solving Large Sparse Linear Systems over Finite Fields

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.

[1]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[2]  Arjen K. Lenstra,et al.  Factoring With Two Large Primes , 1990, EUROCRYPT.

[3]  Don Coppersmith,et al.  Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.

[4]  James H. Davenport,et al.  An Application of Factoring , 1985, J. Symb. Comput..

[5]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[6]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[7]  S. Vanstone,et al.  Computing Logarithms in Finite Fields of Characteristic Two , 1984 .

[8]  Andrew M. Odlyzko,et al.  Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.

[9]  Arjen K. Lenstra,et al.  Factoring by Electronic Mail , 1990, EUROCRYPT.

[10]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.

[11]  V. G. Kuznetsov,et al.  Solution of systems of linear equations , 1967 .

[12]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[13]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[14]  B. Anderson,et al.  Asymptotically fast solution of toeplitz and related systems of linear equations , 1980 .

[15]  Andrew M. Odlyzko,et al.  Computation of discrete logarithms in prime fields , 1991, Des. Codes Cryptogr..

[16]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[17]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[18]  Arjen K. Lenstra,et al.  Factoring with two large primes (extended abstract) , 1991 .

[19]  A. B.,et al.  Computation of Discrete Logarithms in Prime Fields , 2022 .

[20]  W. Gragg,et al.  Superfast solution of real positive definite toeplitz systems , 1988 .