On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
From MaRDI portal
Publication:555157
DOI10.1016/j.cam.2010.08.020zbMath1241.94027OpenAlexW1701814608MaRDI QIDQ555157
Publication date: 22 July 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.020
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Exponential sums (11T23)
Related Items (1)
Cites Work
- A one round protocol for tripartite Diffie-Hellman
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- A taxonomy of pairing-friendly elliptic curves
- On the Conjecture of Hardy & Littlewood concerning the Number of Primes of the Form n 2 + a
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Cryptography and Coding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one