Building curves with arbitrary small MOV degree over finite prime fields

DOI10.1007/S00145-004-0219-7MaRDI QIDQ814847zbMATH OpenOpenAlexFDO

Authors Régis Dupont, Andreas Enge, François Morain

Publication date 8 February 2006

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-004-0219-7

zbMATH Keywords

fast algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Constructing elliptic curves of prime order
• Isolated elliptic curves and the MOV attack
• scientific article; zbMATH DE number 1583945
• Efficient CM-constructions of elliptic curves over finite fields
• An algorithmic construction of finite elliptic curves of order divisible by a large prime

Cited in

(15)

• The complexity of class polynomial computation via floating point approximations
• Algebraic curves and cryptography
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• A variant of the large sieve inequality with explicit constants
• Generating pairing-friendly elliptic curve parameters using sparse families
• An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
• Provably secure non-interactive key distribution based on pairings
• A taxonomy of pairing-friendly elliptic curves
• A brief history of pairings
• Elliptic curves suitable for pairing based cryptography
• Isolated elliptic curves and the MOV attack
• Generating more MNT elliptic curves
• Scalable zero knowledge via cycles of elliptic curves
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
• On Cycles of Pairing-Friendly Elliptic Curves

This page was built for publication: Building curves with arbitrary small MOV degree over finite prime fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814847)