Abstract:
Empirical investigations of the computational complexity of algorithms for solving sparse linear systems was conducted for systems appeared in the computation of discrete logarithms in finite prime fields $GF(p)$, $p<10^{135}$.
Key words:
discrete logarithms, number field sieve, sparse linear systems, structured Gaussian elimination, Lanczos algorithm, parallel computations.
Received 05.V.2010
Document Type:
Article
UDC:511.53+519.712.45
Language: Russian
Citation:
A. Ya. Dorofeev, “Solving systems of linear equations arising in the computation of logarithms in a finite prime field”, Mat. Vopr. Kriptogr., 3:1 (2012), 5–51
\Bibitem{Dor12}
\by A.~Ya.~Dorofeev
\paper Solving systems of linear equations arising in the computation of logarithms in a~finite prime field
\jour Mat. Vopr. Kriptogr.
\yr 2012
\vol 3
\issue 1
\pages 5--51
\mathnet{http://mi.mathnet.ru/mvk47}
\crossref{https://doi.org/10.4213/mvk47}
Linking options:
https://www.mathnet.ru/eng/mvk47
https://doi.org/10.4213/mvk47
https://www.mathnet.ru/eng/mvk/v3/i1/p5
This publication is cited in the following 5 articles:
Citation in format AMSBIB
Contact us: