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

DOI10.1515/GCC-2016-0005zbMath1336.14021OpenAlexW2326003419MaRDI QIDQ285904

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

Tate pairingAte pairingMiller's algorithmoptimal pairingSelmer curves

Mathematics Subject Classification ID

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

Related Items (1)

Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• Another Elliptic Curve Model for Faster Pairing Computation
• The Eta Pairing Revisited
• Faster Pairing Computations on Curves with High-Degree Twists
• Efficient Arithmetic on Hessian Curves
• Pairing Lattices
• The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
• Implementing Pairings at the 192-Bit Security Level
• Optimal Pairings
• Advances in Elliptic Curve Cryptography
• Information and Communications Security

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