Paper 2025/384
Optimizing Final Exponentiation for Pairing-Friendly Elliptic Curves with Odd Embedding Degrees Divisible by 3
Abstract
In pairing-based cryptography, the final exponentiation with a large fixed exponent is crucial for ensuring unique outputs in both Tate and optimal ate pairings. While significant strides have been made in optimizing elliptic curves with even embedding degrees, progress remains limited for curves with odd embedding degrees, especially those divisible by
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Elliptic curvespairingsfinal exponentiationcyclotomic cubingcomplexity
- Contact author(s)
-
ghammam loubna @ gmail com
nadia elmrabet @ emse fr
haddajiwalid95 @ gmail com
leila benabdelghani @ gmail com - History
- 2025-04-17: last of 2 revisions
- 2025-02-28: received
- See all versions
- Short URL
- https://ia.cr/2025/384
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/384, author = {Loubna Ghammam and Nadia El Mrabet and Walid Haddaji and Leila Ben Abdelghani}, title = {Optimizing Final Exponentiation for Pairing-Friendly Elliptic Curves with Odd Embedding Degrees Divisible by 3}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/384}, year = {2025}, url = {https://eprint.iacr.org/2025/384} }