A Variant of Miller’s Formula and Algorithm

DOI10.1007/978-3-642-17455-1_26zbMath1273.14049OpenAlexW1607855054MaRDI QIDQ3059666

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

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) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (4)

Further refinements of Miller's algorithm on Edwards curves ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2

This page was built for publication: A Variant of Miller’s Formula and Algorithm