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.
Fulltext:
PDF file (467 kB)