Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs

DOI10.1007/978-3-319-16277-5_2zbMath1400.94152arXiv1209.5520OpenAlexW1552834175MaRDI QIDQ2949470

Hamza Jeljeli

Publication date: 1 October 2015

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5520

zbMATH Keywords

discrete logarithm problemGPUsresidue number systemmodular arithmeticsparse-matrix-vector product

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (2)

Index calculus in the trace zero variety ⋮ Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• Solving sparse linear equations over finite fields
• A monte carlo method for factorization
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
• Discrete Logarithm in GF(2809) with FFS

This page was built for publication: Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs