Cryptology ePrint Archive: Report 2022/412

Complete and Improved FPGA Implementation of Classic McEliece

Po-Jen Chen and Tung Chou and Sanjay Deshpande and Norman Lahr and Ruben Niederhagen and Jakub Szefer and Wen Wang

Abstract: We present the first specification-compliant constant-time FPGA implementation of the Classic McEliece cryptosystem from the third-round of NIST's Post-Quantum Cryptography standardization process. In particular, we present the first complete implementation including encapsulation and decapsulation modules as well as key generation with seed expansion. All the hardware modules are parametrizable, at compile time, with security level and performance parameters. As the most time consuming operation of Classic McEliece is the systemization of the public key matrix during key generation, we present and evaluate three new algorithms that can be used for systemization while complying with the specification: hybrid early-abort systemizer (HEA), single-pass early-abort systemizer (SPEA), and dual-pass early-abort systemizer (DPEA). All of the designs outperform the prior systemizer designs for Classic McEliece by 2.2x to 2.6x in average runtime and by 1.7x to 2.4x in time-area efficiency. We show that our complete Classic McEliece design for example can perform key generation in 5.2-20ms, encapsulation in 0.1-0.5ms, and decapsulation in 0.7-1.5ms for all security levels on an Xlilinx Artix 7 FPGA. The performance can be increased even further at the cost of resources by increasing the level of parallelization using the performance parameters of our design.

Category / Keywords: implementation / Classic McEliece, Encapsulation Mechanism, Code-Based Cryptography, PQC, FPGA, Hardware Implementation

Original Publication (in the same form): IACR-CHES-2022

Date: received 30 Mar 2022

Contact author: ruben at polycephaly org

Available format(s): PDF | BibTeX Citation

Version: 20220331:073448 (All versions of this report)

Short URL: ia.cr/2022/412


[ Cryptology ePrint archive ]