Building curves with arbitrary small MOV degree over finite prime fields

DOI10.1007/s00145-004-0219-7zbMath1084.94014OpenAlexW2060770809MaRDI QIDQ814847

Andreas Enge, Régis Dupont, 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

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

Related Items (14)

Generating pairing-friendly elliptic curve parameters using sparse families ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ Algebraic curves and cryptography ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Provably secure non-interactive key distribution based on pairings ⋮ Generating more MNT elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ A variant of the large sieve inequality with explicit constants ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Elliptic curves suitable for pairing based cryptography ⋮ A Brief History of Pairings

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