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.
CITATION STYLE
LaMacchia, B. A., & Odlyzko, A. M. (1991). Solving large sparse linear systems over finite fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 537 LNCS, pp. 109–133). Springer Verlag. https://doi.org/10.1007/3-540-38424-3_8
Mendeley helps you to discover research relevant for your work.