A variant of Miller's formula and algorithm

DOI10.1007/978-3-642-17455-1_26MaRDI QIDQ3059666zbMATH OpenOpenAlexFDO

Authors John L. Boxall, Nadia El Mrabet, Fabien Laguillaumie, Duc-Phong Le

Publication date 26 November 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17455-1_26

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Computing bilinear pairings on elliptic curves with automorphisms
• Further refinements of Miller's algorithm on Edwards curves
• Further refinement of pairing computation based on Miller's algorithm
• The Weil pairing, and its efficient calculation

Cited in

(12)

• 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
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• Avoiding full extension field arithmetic in pairing computations
• Delaying mismatched field multiplications in pairing computations
• Fixed argument pairings
• Integer Variable χ–Based Ate Pairing
• Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
• Efficient self-pairing on ordinary elliptic curves
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Closed formulae for the Weil pairing inversion

This page was built for publication: A variant of Miller's formula and algorithm

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