Refinement of Miller's algorithm over Edwards curves

DOI10.1007/978-3-642-11925-5_8MaRDI QIDQ5189444zbMATH OpenOpenAlexFDO

Authors Dongdai Lin, Lei Xu

Publication date 16 March 2010

Published in Topics in Cryptology - CT-RSA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11925-5_8

zbMATH Keywords

bilinear pairingcryptographyMiller algorithmtwisted Edwards curve

Mathematics Subject Classification ID

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

Recommendations

• Further refinements of Miller's algorithm on Edwards curves
• Faster computation of the Tate pairing
• Faster Addition and Doubling on Elliptic Curves
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• Another Approach to Pairing Computation in Edwards Coordinates

Cited in

(8)

• The Weil pairing, and its efficient calculation
• Further refinement of pairing computation based on Miller's algorithm
• Further refinements of Miller's algorithm on Edwards curves
• Pairing computation on Edwards curves with high-degree twists
• Application of scalar multiplication of Edwards curves to pairing-based cryptography
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• Another Approach to Pairing Computation in Edwards Coordinates
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties

This page was built for publication: Refinement of Miller's algorithm over Edwards curves

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