跳到主要导航 跳到搜索 跳到主要内容

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

  • Yu Dai
  • , Fangguo Zhang
  • , Chang-An Zhao
  • School of Computer Science and Engineering
  • Guangdong Key Laboratory of Information Security
  • School of Mathematics

科研成果: 期刊稿件 › 论文 › 同行评审

5 引用 (Scopus)

摘要

Pairing-friendly curves with odd prime embedding degrees at the 128bit 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 efficiency. Our implementation results on a 64-bit processor show that the gap in the performance of pairing computation between BW13-310 and BN446 (resp. BLS12-446) is only up to 4.9% (resp. 26%). More importantly, compared to BN446 and BLS12-446, BW13-310 is about 109.1% − 227.3%, 100% − 192.6%, 24.5% − 108.5% and 68.2% − 145.5% faster in terms of hashing to G1, exponentiations in G1 and GT, and membership testing for GT, respectively. These results reveal that BW13-310 would be an interesting candidate in pairing-based cryptographic protocols. © 2023, Ruhr-University of Bochum. All rights reserved.
源语言英语
页(从-至)393-419
页数27
期刊IACR Transactions on Cryptographic Hardware and Embedded Systems
卷2023
期4
DOI
出版状态已出版 - 31 8月 2023

基金资助

- [2019B030302008]; National Natural Science Foundation of China, Number: -, Acronym: NSFC, National Natural Science Foundation of China (NSFC) [61972428,61972429];

关键词

  • Computational efficiency
  • Embeddings
  • Bw13-310
  • Exponentiations
  • High-performance software implementation
  • Odd prime
  • Pairing-friendly curves
  • Performance
  • Prime field
  • Security level
  • Software implementation
  • Public key cryptography
  • BW13-310
  • high-performance software implementations

收录

  • Scopus
  • EI

学术指纹

探究 'Don’t Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees' 的科研主题。它们共同构成独一无二的学术指纹。

引用此