|
This article is cited in 5 scientific papers (total in 5 papers)
Solving systems of linear equations arising in the computation of logarithms in a finite prime field
A. Ya. Dorofeev SUE RDI "Kvant", Moscow
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
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
Linking options:
https://www.mathnet.ru/eng/mvk47https://doi.org/10.4213/mvk47 https://www.mathnet.ru/eng/mvk/v3/i1/p5
|
|