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

DOI10.1515/GCC-2016-0005zbMATH Open1336.14021OpenAlexW2326003419MaRDI QIDQ285904FDOQ285904

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

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

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)

Cites Work

• The Magma algebra system. I: The user language
• A taxonomy of pairing-friendly elliptic curves
• Title not available (Why is that?)
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• Title not available (Why is that?)
• 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

Cited In (7)

• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Title not available (Why is that?)
• 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\)

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)