Hardware implementation of K2RED and plantard modular multiplication algorithms in post-quantum cryptography

Official URL: https://dx.doi.org/10.1109/PACET60398.2024.10497033

As the era of Post-Quantum Cryptography emerges, the demand for efficient and secure cryptographic algorithms has intensified. This conference paper navigates through the details of employing Number Theoretic Transform based modular multiplication algorithm which is K2RED tailored for post-quantum cryptographic applications, with a specific emphasis on their Field Programmable Gate Array implementation. NTT is an operation of Lattice Based Cryptography and it converts the numbers to finite field and modular multiplication operation is carried out. So, modular multiplication is the essential operation of NTT and its efficiency is critical for NTT operation. Our findings not only contribute to the growing body of knowledge in PQC but also offer practical guidance for engineers and researchers seeking to implement robust and efficient cryptographic solutions on FPGA platforms. The presented performance metrics serve as a benchmark for evaluating the feasibility and scalability of modular multiplication algorithms in the context of PQC systems. We present a detailed analysis of the area, speed, and latency performance of the implemented modular multiplication algorithms on FPGA platforms. Given the novelty offered by this study, it has demonstrated that the K2RED algorithm can be used with different bit lengths. Similarly, Plantard and K2RED algorithms have been utilized to create and report different circuit schematics according to various requirements.