Refinements of Miller's algorithm for computing the Weil/Tate pairing
From MaRDI portal
Publication:5468866
DOI10.1016/j.jalgor.2005.01.009zbMath1093.68037MaRDI QIDQ5468866
Guangwu Xu, V. Kumar Murty, Ian F. Blake
Publication date: 28 April 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2005.01.009
Related Items
Further refinements of Miller's algorithm on Edwards curves, Multibase scalar multiplications in cryptographic pairings, Efficient Tate pairing computation using double-base chains, Further refinement of pairing computation based on Miller's algorithm, Deterministic Encoding into Twisted Edwards Curves, Pairing Computation on Edwards Curves with High-Degree Twists