Don’t Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees

Abstract: Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13-310 and BW19-286, sparked interest in the field of public-key cryptography as small sizes of the prime fields. However, compared to mainstream pairing-friendly curves at the same security level, i.e., BN446 and BLS12-446, the performance of pairing computations on BW13-310 and BW19-286 is usually considered inefficient. In this paper we investigate high performance software implementations of pairing computation on BW13-310 and corresponding building blocks used in pairing-based protocols, including hashing, group exponentiations and membership testings. Firstly, we propose efficient explicit formulas for pairing computation on this curve. Moreover, we also exploit the state-of-art techniques to implement hashing in G1 and G2, group exponentiations and membership testings. In particular, for exponentiations in G2 and GT , we present new optimizations to speed up computational effici.... https://tches.iacr.org/index.php/TCHES/article/view/11171

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch

References and Relationships

• Bibliographic citation: Don’t Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees ; volume:2023 ; number:4 ; year:2023 ; IACR transactions on cryptographic hardware and embedded systems ; 2023, Heft 4 (2023)

Contributors, Places and Time

• Creator: Dai, Yu ; Zhang, Fangguo ; Zhao, Chang-an

Further information

• DOI: 10.46586/tches.v2023.i4.393-419
• URN: urn:nbn:de:101:1-2023102518565763899713
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 14.08.2025, 10:52 AM CEST