Solving Large Sparse Linear Systems Over Finite Fields.

Many of the fast methods for factoring integers and computing discrete algorithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of an implementation 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.