Paper 2024/575
Pairing Optimizations for Isogeny-based Cryptosystems
Abstract
In isogeny-based cryptography, bilinear pairings are regarded as a powerful tool in various applications, including key compression, public-key validation and torsion basis generation. However, in most isogeny-based protocols, the performance of pairing computations is unsatisfactory due to the high computational cost of the Miller function. Reducing the computational expense of the Miller function is crucial for enhancing the overall performance of pairing computations in isogeny-based cryptography.
This paper addresses this efficiency bottleneck. To achieve this, we propose several techniques for a better implementation of pairings in isogeny-based cryptosystems. We use (modified) Jacobian coordinates and present new algorithms for Miller function computations to compute pairings of order
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Pairing computationsIsogeny-based cryptographySupersingularity verificationTorsion basis generation
- Contact author(s)
-
caishp6 @ mail2 sysu edu cn
linkzh5 @ mail2 sysu edu cn
zhaochan3 @ mail sysu edu cn - History
- 2024-04-16: approved
- 2024-04-15: received
- See all versions
- Short URL
- https://ia.cr/2024/575
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/575, author = {Shiping Cai and Kaizhan Lin and Chang-An Zhao}, title = {Pairing Optimizations for Isogeny-based Cryptosystems}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/575}, year = {2024}, url = {https://eprint.iacr.org/2024/575} }