Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
From MaRDI portal
Publication:5267408
DOI10.1109/TC.2013.125zbMath1364.94550OpenAlexW2069313048MaRDI QIDQ5267408
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
Related Items (4)
Further refinements of Miller's algorithm on Edwards curves ⋮ On the near prime-order MNT curves ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ Deterministic Encoding into Twisted Edwards Curves
This page was built for publication: Improved Miller’s Algorithm for Computing Pairings on Edwards Curves