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.
|Original language||English (US)|
|Title of host publication||Advances in Cryptology – CRYPTO 1990, Proceedings|
|Editors||Alfred J. Menezes, Scott A. Vanstone|
|Number of pages||25|
|State||Published - 1991|
|Event||10th Conference on the Theory and Application of Cryptography, CRYPTO 1990 - Santa Barbara, United States|
Duration: Aug 11 1990 → Aug 15 1990
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||10th Conference on the Theory and Application of Cryptography, CRYPTO 1990|
|Period||8/11/90 → 8/15/90|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.