Improved Miller’s Algorithm for Computing Pairings on Edwards Curves

DOI10.1109/TC.2013.125MaRDI QIDQ5267408zbMATH OpenOpenAlexFDO

Authors Duc-Phong Le, Chik How Tan

Publication date 20 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2013.125

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Cited in

(4)

• On the near prime-order MNT curves
• Deterministic encoding into twisted Edwards curves
• On near prime-order elliptic curves with small embedding degrees
• Further refinements of Miller's algorithm on Edwards curves

This page was built for publication: Improved Miller’s Algorithm for Computing Pairings on Edwards Curves

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