On the asymptotic effectiveness of Weil descent attacks
Journal of Mathematical Cryptology, 2010 In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields.
Karabina Koray +3 more
doaj +1 more source
On the discrete logarithm problem in finite fields of fixed characteristic [PDF]
, 2016 Robert Granger +2 more
openalex +1 more source
Finding discrete logarithm in $F_p^* $
, 2021 Additional python code file in pdf ...
openaire +2 more sources
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm [PDF]
, 1999 Masahide Abe, Tatsuaki Okamoto
openalex +1 more source
Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures [PDF]
, 2014 Hamza Jeljeli
openalex +1 more source
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order [PDF]
, 2005 Endre Bangerter +2 more
openalex +1 more source
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method [PDF]
, 2002 Antoine Joux, Reynald Lercier
openalex +1 more source
Cougar: Cubic Root Verifier Inner Product Argument Under Discrete Logarithm Assumption
IEEE AccessAn inner product argument (IPA) is a cryptographic proof system that serves as a fundamental building block for various applications, such as zero knowledge proofs and verifiable computation.
Hyeonbum Lee +3 more
doaj +1 more source
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves [PDF]
, 2008 Benjamin Smith
openalex +1 more source
Cryptographic Complexity and P vs. NP: A Unified Analysis of Discrete Logarithms, Error Matrix Verification, and Modern Cryptographic Systems [PDF]
J. Edwards, Fei Fei Li
openalex +1 more source