Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
From MaRDI portal
Publication:4372702
DOI10.1090/S0025-5718-98-00887-4zbMath1016.11021OpenAlexW1979485530WikidataQ56047757 ScholiaQ56047757MaRDI QIDQ4372702
Publication date: 16 December 1997
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-98-00887-4
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Elliptic curves over local fields (11G07)
Related Items
Constructing Isogenies between Elliptic Curves Over Finite Fields ⋮ Number of rational points of elliptic curves ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ DiSSECT: distinguisher of standard and simulated elliptic curves via traits ⋮ The number of rational points of hyperelliptic curves over subsets of finite fields ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\) ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon\)] ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ Elliptic curve lifting problem and its applications ⋮ Computational hardness of IFP and ECDLP ⋮ Amicable Pairs and Aliquot Cycles for Elliptic Curves ⋮ Algebraic curves and cryptography ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ On the asymptotic effectiveness of Weil descent attacks ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ On the security properties of Russian standardized elliptic curves ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ Several security schemes constructed using ECC-based self-certified public key cryptosystems ⋮ On the discrete logarithm in the divisor class group of curves ⋮ Bitcoin security with a twisted Edwards curve
Cites Work
- Unnamed Item
- Unnamed Item
- Elliptic Curve Cryptosystems
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
