Paper 2019/385 Original: eprint.iacr.org/2019/385 ↗
Miller Inversion is Easy for the Reduced Tate Pairing of Embedding Degree Greater than one
Abstract
We present algorithms for Miller inversion for the reduced Tate pairing with embedding degree k>1. Let q be a number of elements of field of definition of an elliptic curve. For even k, our algorithm run deterministically with O((k log q)^3) bit operations. For odd k, out algorithm run probabilistically with O(k^6 (log q)^3) bit operations in average.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2025-01-30: last updated
- 2019-04-16: published
- Short URL
- https://ia.cr/2019/385
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/385,
author = {Takakazu Satoh},
title = {Miller Inversion is Easy for the Reduced Tate Pairing of Embedding Degree Greater than one},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/385},
year = {2019},
url = {https://eprint.iacr.org/2019/385}
}