Heuristics on pairing-friendly elliptic curves

Journal of mathematical cryptology

article

John Boxall¹ 

[1] Laboratoire de Mathématiques Nicolas Oresme, Université de Caen Basse-Normandie

关键词: Elliptic curves;    finite fields;    pairing-based cryptography;   

DOI  :  10.1515/jmc-2011-0004

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

Abstract. We present a heuristic asymptotic formula as for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree , with fixed discriminant, with rho-value bounded by a fixed such that , and with prime subgroup order at most x .

【 授权许可】

CC BY|CC BY-NC-ND