On finite fields for pairing based cryptography

DOI10.3934/AMC.2007.1.281zbMath1169.11025OpenAlexW1984494418MaRDI QIDQ2470809

Florian Luca, Igor E. Shparlinski

Publication date: 15 February 2008

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2007.1.281

zbMATH Keywords

elliptic curvespairing based cryptographyembedding degreeheuristic lower boundscarcity of the pairing friendly fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20)

Related Items (1)

On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves

This page was built for publication: On finite fields for pairing based cryptography