Parallel implementations of post-quantum leighton-Micali signature on multiple nodes

• Published in: The Journal of supercomputing Vol. 80; no. 4; pp. 5042 - 5072
• Main Authors: Kang, Yan, Dong, Xiaoshe, Wang, Ziheng, Chen, Heng, Wang, Qiang
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.03.2024; Springer Nature B.V
• Subjects: Algorithms; Cloud computing; Compilers; Computer Science; Data encryption; Design optimization; Digital signatures; Interpreters; Nodes; Parallel processing; Processor Architectures; Programming Languages; Quantum computers; Quantum cryptography; Post-quantum cryptography; Stateful hash-based signatures; HSS; Parallel computing; LMS
• ISSN: 0920-8542; 1573-0484
• DOI: 10.1007/s11227-023-05662-w

To defend against quantum computer attacks, the National Institute of Standards and Technology (NIST) has been exploring post-quantum cryptography (PQC). Now, NIST has standardized only two PQC algorithms, one of which is the Leighton-Micali signature (LMS). However, the performance of LMS limits its practical application. In this paper, we propose a parallel LMS implementation on multiple nodes. Considering different application scenarios, we provide two parallel schemes: algorithmic parallelism and data parallelism. The main part of our work is the two-tier parallel structure for the LMS tree. Targeting the x86/64 multiple nodes, our work introduces vectorization to present the three-tier parallel structure. We also design communication optimization, including the selection of communication primitives and the creation of communicators for multi-node running. Experimental evidence shows that our code effectively reduces the latency, and is 19.04 × faster than the fastest implementation on the same platform when running key pair generation for LMS_SHA256_M32_H20(20).