Accelerating Iterative SpMV for Discrete Logarithm Problem using GPUs

@article{Jeljeli2012AcceleratingIS,
  title={Accelerating Iterative SpMV for Discrete Logarithm Problem using GPUs},
  author={Hamza Jeljeli},
  journal={CoRR},
  year={2012},
  volume={abs/1209.5520}
}
In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve, requires solving large sparse systems of linear equations modulo the group order. Most of the fast algorithms used to solve such systems — e.g., the conjugate gradient or the Lanczos and Wiedemann algorithms — iterate a product of the corresponding sparse matrix with a vector (SpMV). This central operation can be… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS