Effective Pairings in Isogeny-Based Cryptography

Reijnders, Krijn

doi:10.1007/978-3-031-44469-2_6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Extending Class Group Action Attacks via Sesquilinear Pairings

Macula,

Stange

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Extending Class Group Action Attacks via Sesquilinear Pairings

Macula,

Stange

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees

Lin,

Cai

et al. 2024

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Pairing Optimizations for Isogeny‐Based Cryptosystems

Cai,

Lin,

Zhao

2024

IET Information Security

View full text Add to dashboard Cite

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 2∙ and 3∙. For pairings of arbitrary order, which are crucial for key compression in some SIDH‐based schemes (such as M‐SIDH and binSIDH), we combine Miller doublings with Miller additions/subtractions, leading to a considerable speedup. Moreover, the optimizations for pairing applications in CSIDH‐based protocols are also considered in this paper. In particular, our approach for supersingularity verification in CSIDH is 15.3% faster than Doliskani’s test, which is the state‐of‐the‐art.

show abstract

Effective Pairings in Isogeny-Based Cryptography

Cited by 3 publications

References 35 publications

Extending Class Group Action Attacks via Sesquilinear Pairings

Extending Class Group Action Attacks via Sesquilinear Pairings

Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees

Pairing Optimizations for Isogeny‐Based Cryptosystems

Contact Info

Product

Resources

About