Usuario: guest
No has iniciado sesión
No has iniciado sesión
Type: Article
On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
Abstract:
We give an upper 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, and present some heuristic arguments which indicate that this bound is tight. We also refine some heuristic arguments on the total number of so-called MNT curves with prime cardinalities which have been recently presented by various authors.
We give an upper 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, and present some heuristic arguments which indicate that this bound is tight. We also refine some heuristic arguments on the total number of so-called MNT curves with prime cardinalities which have been recently presented by various authors.
Keywords: Elliptic curves; pairing based cryptography; embedding degree; MNT curves
MSC: 11G20 (11N56 11T71 14G50)
Journal: Mathematics of Computation
ISSN: 0025-5718
Year: 2012
Volume: 81
Number: 278
Pages: 1093--1110



Autores Institucionales Asociados a la Referencia: