On finite fields for pairing based cryptography

Florian Luca*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Here, we improve our previous bound on the number of finite fields over which elliptical curves of cryptographic interest with a given embedding degree and small complex multiplication discrimination may excist. We also give some heuristic arguements which lead to a lower bound which in some cases is close to our upper bound.

Original languageEnglish
Pages (from-to)281-286
Number of pages6
JournalAdvances in Mathematics of Communications
Issue number3
Publication statusPublished - Aug 2007


  • elliptical curves
  • pairing based cryptography
  • embedding degree
  • WEIL


Dive into the research topics of 'On finite fields for pairing based cryptography'. Together they form a unique fingerprint.

Cite this