Isolated elliptic curves and the MOV attack
From MaRDI portal
Publication:1676235
DOI10.1515/jmc-2016-0053zbMath1432.11066OpenAlexW2614048686MaRDI QIDQ1676235
Publication date: 6 November 2017
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2016-0053
Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Isogeny (14K02)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the embedding degree of reductions of an elliptic curve
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Nonsingular plane cubic curves over finite fields
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The discrete logarithm problem on elliptic curves of trace one
- MOV attack in various subgroups on elliptic curves
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Cryptographic implications of Hess' generalized GHS attack
- Integer-Valued Polynomials
- Isogeny volcanoes
- Sur certaines hypothèses concernant les nombres premiers
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Choosing the correct elliptic curve in the CM method
- Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
- The Arithmetic of Elliptic Curves
- Limitations to the equi-distribution of primes. IV
- Reducing elliptic curve logarithms to logarithms in a finite field
- Using a parity-sensitive sieve to count prime values of a polynomial
- Gaussian primes
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- On Eisenstein primes
- Modular polynomials via isogeny volcanoes
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
- Algorithmic Number Theory
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Isolated elliptic curves and the MOV attack