Faster Ate pairing computation on Selmer's model of elliptic curves

DOI10.1515/GCC-2016-0005MaRDI QIDQ285904zbMATH OpenOpenAlexFDO

Authors Emmanuel Fouotsa, Abdoul Aziz Ciss

Publication date 19 May 2016

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2016-0005

zbMATH Keywords

Ate pairingMiller's algorithmoptimal pairingSelmer curvesTate pairing

Mathematics Subject Classification ID

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

Recommendations

• Another elliptic curve model for faster pairing computation
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
• Faster computation of the Tate pairing
• Speeding up Ate pairing computation in affine coordinates
• Efficient pairing computation on curves

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A taxonomy of pairing-friendly elliptic curves
• Advances in Elliptic Curve Cryptography
• Another elliptic curve model for faster pairing computation
• Efficient arithmetic on Hessian curves
• Efficient pairing computation on supersingular abelian varieties
• Faster pairing computations on curves with high-degree twists
• Implementing pairings at the 192-bit security level
• Information and Communications Security
• Optimal Pairings
• Pairing Lattices
• The Eta Pairing Revisited
• The Magma algebra system. I: The user language
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation

Cited in

(7)

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• scientific article; zbMATH DE number 1962162 (Why is no real title available?)
• Another elliptic curve model for faster pairing computation
• Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
• Fast Architectures for the \eta_T Pairing over Small-Characteristic Supersingular Elliptic Curves
• Faster computation of the Tate pairing
• Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees \(k=5,7\)

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Faster Ate pairing computation on Selmer's model of elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285904)