Efficient GPU Implementations of Post-Quantum Signature XMSS

被引:6
|
作者
Wang, Ziheng [1 ]
Dong, Xiaoshe [1 ]
Chen, Heng [1 ]
Kang, Yan [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Comp Sci & Technol, Xian 710049, Peoples R China
关键词
Post-quantum cryptography; stateful hash-based signatures; XMSS; XMSSMT; parallel computing; GPU; FRODOKEM;
D O I
10.1109/TPDS.2022.3233348
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The National Institute of Standards and Technology (NIST) approved XMSS as part of the post-quantum cryptography (PQC) development effort in 2018. XMSS is currently one of only two standardized PQC algorithms, but its performance limits its use. For example, the fastest record for some standardized parameters still takes more than a minute to generate a keypair. In this article, we present the first GPU implementation for XMSS and its variant XMSSMT. The high parallelism of GPUs is especially effective for reducing latency in key generation and improving throughput for signing and verifying. In order to meet various application scenarios, we provide three parallel XMSS schemes: algorithmic parallelism, multi-keypair data parallelism, and single-keypair data parallelism. For these schemes, we design custom parallel strategies that use more than 10,000 cores for all parameters provided by NIST. In addition, we analyze the availability of most previous serial optimizations and explore numerous techniques to fully exploit GPU performance. Our evaluations are made with the XMSSMT-SHA2_20/2_256 parameter set on a GeForce RTX 3090. The result shows the key generation latency is 3.20 ms, a speedup of 21,899x compared to the GPU ported version, which is also 54x speedup faster than the fastest work (174 ms). When 16384 tasks are executed, the throughput (task/s) for signing/verifying in the single-key and multi-key cases is 311,424/415,100 and 145,100/419,887, respectively. Compared to the throughput for signing/verifying (1695/ 4000) of the fastest work, we obtain a speedup of 184x/104x and 86x/105x in single-key and multi-key cases, respectively.
引用
收藏
页码:938 / 954
页数:17
相关论文
共 50 条
  • [21] HORSIC plus : An Efficient Post-Quantum Few-Time Signature Scheme
    Lee, Jaeheung
    Park, Yongsu
    APPLIED SCIENCES-BASEL, 2021, 11 (16):
  • [22] Candidate for practical post-quantum signature scheme
    Moldovyan, N. A.
    Moldovyan, A. A.
    VESTNIK SANKT-PETERBURGSKOGO UNIVERSITETA SERIYA 10 PRIKLADNAYA MATEMATIKA INFORMATIKA PROTSESSY UPRAVLENIYA, 2020, 16 (04): : 455 - 461
  • [23] A Comparative Study of Post-Quantum Cryptographic Algorithm Implementations for Secure and Efficient Energy Systems Monitoring
    Satrya, Gandeva Bayu
    Agus, Yosafat Marselino
    Mnaouer, Adel Ben
    ELECTRONICS, 2023, 12 (18)
  • [24] Efficient Parallel Implementations of LWE-Based Post-Quantum Cryptosystems on Graphics Processing Units
    An, SangWoo
    Seo, Seog Chung
    MATHEMATICS, 2020, 8 (10) : 1 - 21
  • [25] Efficient and reliable post-quantum authentication
    D'Arco, Paolo
    De Prisco, Roberto
    Pozo, Angel Perez del
    THEORETICAL COMPUTER SCIENCE, 2024, 1003
  • [26] Post-Quantum Lattice-Based Cryptography Implementations: A Survey
    Nejatollahi, Hamid
    Dutt, Nikil
    Ray, Sandip
    Regazzoni, Francesco
    Banerjee, Indranil
    Cammarota, Rosario
    ACM COMPUTING SURVEYS, 2019, 51 (06)
  • [27] ENR DigiSig: an efficient post-quantum digital signature scheme using polar codes
    Khurana, Rupali
    Narwal, Ekta
    Ahlawat, Sonika
    QUANTUM INFORMATION PROCESSING, 2024, 23 (07)
  • [28] MQIBS: An Efficient Post-Quantum Identity-based Signature from Multivariate Polynomials
    Van Luyen, Le
    Informatica (Slovenia), 2025, 49 (11): : 57 - 66
  • [29] U-EPS: An Ultra-small and Efficient Post-quantum Signature Scheme
    Gong, Guang
    He, Morgan
    Rohit, Raghvendra
    Yi, Yunjie
    FOUNDATIONS AND PRACTICE OF SECURITY, FPS 2019, 2020, 12056 : 261 - 272
  • [30] On the Suitability of Post-Quantum Signature Schemes for Internet of Things
    Shim, Kyung-Ah
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (06) : 10648 - 10665