Advertisement
Published in:
1991 | OriginalPaper | Chapter
Solving Large Sparse Linear Systems Over Finite Fields
Authors : B. A. LaMacchia, A. M. Odlyzko
Published in: Advances in Cryptology-CRYPT0’ 90
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.