|
Computational methods in discrete mathematics
Modular arithmetic optimization in Kyber KEM
A. S. Zelenetskyab, P. G. Klyuchareva a Bauman Moscow State Technical University
b ООО «Ку Апп»
Abstract:
Kyber is a post-quantum key encapsulation mechanism that has been selected as a finalist in the third round of the NIST Post-Quantum Cryptography Competition. Today, Kyber is the only post-quantum key encapsulation mechanism recommended for standardization by NIST. The paper presents a new approach to optimize arithmetic operations in Kyber KEM. It reduces the number of modular reductions by increasing the bit size of numbers. The proposed optimization is appropriate for the general purpose systems with 32 or 64-bit CPUs. According to the benchmarking, our optimization speeds up the decapsulation algorithm by up to 1.83 times, the encapsulation algorithm — by up to 1.58 times, and the key generation — by up to 1.41 times.
Keywords:
Kyber, modular arithmetic, post-quantum cryptography, lattice-based cryptography.
Citation:
A. S. Zelenetsky, P. G. Klyucharev, “Modular arithmetic optimization in Kyber KEM”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 162–166
Linking options:
https://www.mathnet.ru/eng/pdma672 https://www.mathnet.ru/eng/pdma/y2024/i17/p162
|
Statistics & downloads: |
Abstract page: | 47 | Full-text PDF : | 37 | References: | 17 |
|