Elliptic curves withj= 0,1728 and low embedding degree

DOI10.1080/00207160.2015.1083556zbMath1359.14031OpenAlexW2280397879MaRDI QIDQ2958273

Daniel Sadornil, Juan G. Tena Ayuso, Josep M. Miret Biosca

Publication date: 1 February 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1083556

zbMATH Keywords

elliptic curvesembedding degreedistortion mapBateman-Horn's conjecture

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Pairing-based cryptography on elliptic curves

Cites Work

• Unnamed Item
• On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Efficient implementation of pairing-based cryptosystems
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Complex multiplication structure of elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• Elliptic curves suitable for pairing based cryptography
• A Generalization of Verheul’s Theorem for Some Ordinary Curves
• Finitely Generated Abelian Groups and Similarity of Matrices over a Field
• On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
• Advances in Elliptic Curve Cryptography

This page was built for publication: Elliptic curves withj= 0,1728 and low embedding degree