Heuristics on pairing-friendly elliptic curves

DOI10.1515/jmc-2011-0004zbMath1277.94014arXiv1107.0307OpenAlexW2964086213MaRDI QIDQ4650074

John L. Boxall

Publication date: 23 November 2012

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.0307

zbMATH Keywords

elliptic curvesfinite fieldspairing-based cryptographyisogeny classesheuristic asymptotic formulapairing-friendly elliptic curves over prime fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Distribution of integers with specified multiplicative constraints (11N25) Rate of growth of arithmetic functions (11N56)

Related Items (3)

Heuristics on pairing-friendly abelian varieties ⋮ Heuristics of the Cocks-Pinch method ⋮ Heuristic counting of Kachisa-Schaefer-Scott curves

Cites Work

• Unnamed Item
• Eisenstein series of \(1\over 2\)-integral weight and the mean value of real Dirichlet L-series
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• A note on certain arithmetical constants
• Endomorphisms of Abelian varieties over finite fields

This page was built for publication: Heuristics on pairing-friendly elliptic curves