On finite fields for pairing based cryptography | Zendy

Igor E. Shparlinski | Zendy; Florian Luca | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On finite fields for pairing based cryptography

Author(s) -

Igor E. Shparlinski,

Florian Luca

Publication year - 2007

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2007.1.281

Subject(s) - mathematics , finite field , upper and lower bounds , pairing , cryptography , embedding , elliptic curve , discriminant , degree (music) , multiplication (music) , heuristic , discrete mathematics , pure mathematics , combinatorics , algorithm , mathematical analysis , computer science , artificial intelligence , mathematical optimization , physics , superconductivity , quantum mechanics , acoustics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research