Faster Pairing Computations on Curves with High-Degree Twists

DOI10.1007/978-3-642-13013-7_14zbMath1279.94069OpenAlexW2114609370MaRDI QIDQ3562898

Michael Naehrig, Tanja Lange, Craig Costello

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_14

zbMATH Keywords

pairingsexplicit formulastwistsTate pairingAte pairingMiller functionsWeierstrass curves

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (18)

Faster Ate pairing computation on Selmer's model of elliptic curves ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ A formula for disaster: a unified approach to elliptic curve special-point-based attacks ⋮ Faster computation of the Tate pairing ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ The pairing computation on Edwards curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ RNS arithmetic in 𝔽 pk and application to fast pairing computation ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Parallelizing the Weil and Tate Pairings ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

Uses Software

• EFD

This page was built for publication: Faster Pairing Computations on Curves with High-Degree Twists