Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 466

The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.

A Taxonomy of Pairing-Friendly Elliptic Curves

Open access
Freeman, David, Scott, Michael, Teske, Edlyn·2010·Journal of Cryptology

Abstract

Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such “pairing-friendly” curves are rare and thus require specific constructions. In this paper we give a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature. We also include new constructions of pairing-friendly curves that improve on the previously known constructions for certain embedding degrees. Finally, for all embedding degrees up to 50, we provide recommendations as to which pairing-friendly curves to choose to best satisfy a variety of performance and security requirements.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s00145-009-9048-z

Cites

58 of 58 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 58 references

Cited by

See all 466

Metadata

Authors
Freeman, D., Scott, M., & Teske, E.
Venue
Journal of Cryptology
Published
2009-06-18
Volume
23
Issue
2
Pages
224-280
ISSN
  • 0933-2790 (ISSN-L)
  • 1432-1378
OpenAlex
W2021553056
Cited by
466
References
58
FWCI
127.99
Type
journal article
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Taxonomy of Pairing-Friendly Elliptic Curves. https://app.cochat.ai/papers/10.1007/s00145-009-9048-z
The paper
Freeman, D., Scott, M., & Teske, E. (2010). A Taxonomy of Pairing-Friendly Elliptic Curves. Journal of Cryptology. https://doi.org/10.1007/s00145-009-9048-z

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.