B. A. LaMacchia and A. M. Odlyzko
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 combina- tions of structured Gaussian elimination and the conjugate gradient, Lanczos, and Wiedemann methods.
|Published in||Advances in Cryptography -- Proceedings of CRYPTO '90|
All copyrights reserved by Springer 2007.