Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Curves with fast computations in the first pairing group

Abstract : Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a randomly picked elliptic curve will not support an efficient pairing (the embedding degree will usually be too large to make any computation practical), a pairing-friendly curve has to be carefully constructed. This has led to famous curves, e.g. Barreto-Naehrig curves. However, the computation of the Discrete Logarithm Problem on the finite-field side has received much interest and its complexity has recently decreased. Hence the need to propose new curves has emerged. In this work, we give one new curve that is specifically tailored to be fast over the first pairing-group, which is well suited for several cryptographic schemes, such as group signatures, and their variants, or accumulators.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [40 references]  Display  Hide  Download
Contributor : Rémi Clarisse <>
Submitted on : Monday, September 21, 2020 - 11:30:08 AM
Last modification on : Wednesday, October 14, 2020 - 4:08:55 AM


Files produced by the author(s)


  • HAL Id : hal-02944143, version 1


Rémi Clarisse, Sylvain Duquesne, Olivier Sanders. Curves with fast computations in the first pairing group. 2020. ⟨hal-02944143⟩



Record views


Files downloads