On the Efficient Generation of Generalized MNT Elliptic Curves

DOI10.1007/978-3-642-40663-8_15zbMath1291.94082OpenAlexW158399888MaRDI QIDQ2850011

Elisavet Konstantinou, Georgios Fotiadis

Publication date: 20 September 2013

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/39272

zbMATH Keywords

Pell equationspairing-based cryptographyeffective polynomial familiesMNT elliptic curves

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 (4)

On the near prime-order MNT curves ⋮ Generating pairing-friendly elliptic curve parameters using sparse families ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ TNFS resistant families of pairing-friendly elliptic curves

This page was built for publication: On the Efficient Generation of Generalized MNT Elliptic Curves