期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2021
卷号：99
期号：7
语种：English
出版社：Journal of Theoretical and Applied
摘要：The post-quantum cryptosystem schemes based on Ring-LWE (Ring Learning With Error) problem are among important candidates submitted to the NIST post-quantum cryptosystem standardization project. The majority of them use one or more algorithms for speeding-up the polynomials multiplication in the cryptographic process, like the Number Theoretic Transform algorithm (NTT), the Montgomery algorithm, the Karasuba algorithm, etc. We contribute herein, by creating a new Fast Modular Multiplication algorithm (FMMA), which is a variant of the Montgomery algorithm, and we created an improved post-quantum key exchange release based on Ring-LWE problem called "RingLWE_FMMA", by using our FMMA algorithm combined with the NTT algorithm. Our algorithm is tailored specially for the Fermat prime numbers and all the numbers of the form q = 2^k + In this work, we considered the post-quantum key exchange "NewHope" based on Ring-LWE problem, as a study case, which uses the NTT algorithm combined with the Montgomery algorithm. . After a benchmarking, we obtained a good result; our RingLWE_FMMA release is faster than NewHope by a rate of up to 35%, and our FMMA is faster than the Montgomery algorithm by a factor of up to (X2) two times.
