ARMed Frodo

Abstract

FrodoKEM is one of Post-quantum Cryptography, which is selected Round 3 alternate candidates of Public-key Encryption and Key-establishment Algorithms at NIST Post-quantum Cryptography Standardization. FrodoKEM uses AES algorithm for generate pseudo-random matrix, and also uses matrix-multiplication. At that time, a huge computational load occurred to the pseudo-random number generation and matrix-multiplication operation, reducing the overall performance of the FrodoKEM scheme. In this paper, we propose the parallel matrix-multiplication and built-in AES accelerator for AES encryption on ARMv8 processors, and applied these techniques to the FrodoKEM-640 scheme. To implement the parallel matrix-multiplication, vector registers (i.e. 128-bit wise) and vector instructions (i.e. NEON) are used. The proposed parallel matrix-multiplication can be generated 80 element of output matrix at once. As a result, the matrix-multiplication has 43.8$\times$ faster than the normal matrix-multiplication in the best-case, the implementation FrodoKEM-640 with all of proposed techniques has 10.22$\times$ better performance in maximum than previous C only implementation.

This work was partly supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No.2018-0-00264, Research on Blockchain Security Technology for IoT Services, 25%) and this work was partly supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. NRF-2020R1F1A1048478, 25%) and this work was partly supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.2021-0-00540, Development of Fast Design and Implementation of Cryptographic Algorithms based on GPU/ASIC, 25%) and this work was partly supported by Institute for Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (<Q|Crypton>, No.2019-0-00033, Study on Quantum Security Evaluation of Cryptography based on Computational Quantum Complexity, 25%).