Further refinements of Miller's algorithm on Edwards curves

DOI10.1007/S00200-015-0278-ZzbMath1368.94110arXiv1305.2694OpenAlexW1516979521MaRDI QIDQ300877

Chik How Tan, Duc-Phong Le

Publication date: 29 June 2016

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.2694

zbMATH Keywords

Edwards curvesMiller's algorithmpairing computationTate/Weil pairings

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• Faster computation of the Tate pairing
• A complete set of addition laws for incomplete Edwards curves
• A Variant of Miller’s Formula and Algorithm
• Twisted Edwards Curves
• The Eta Pairing Revisited
• Faster Pairing Computations on Curves with High-Degree Twists
• Twisted Edwards Curves Revisited
• Pairing Lattices
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• Optimal Pairings
• Refinement of Miller’s Algorithm Over Edwards Curves
• Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
• Inverted Edwards Coordinates
• Faster Addition and Doubling on Elliptic Curves
• Pairing-Friendly Elliptic Curves of Prime Order
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• Another Approach to Pairing Computation in Edwards Coordinates

This page was built for publication: Further refinements of Miller's algorithm on Edwards curves