Work

Lazy Modular Reduction for NTT

Year: 2024

Type: article

Abstract: The number theoretic transform (NTT) is a fundamental operation in cryptography, especially for lattice-based cryptographic schemes. This paper introduces LazyNTT, a novel method that reduces the number of Montgomery multiplications required in the NTT computation by replacing some of them with standard multiplication without modular reduction. This approach enhances the performance of the NTT computation and modular polynomial multiplication in lattice-based cryptographic schemes. The proposed LazyNTT can be generalized by increasing the number of standard multiplications. The experimental results show that the proposed LazyNTT improves the cycle counts of the NTT by up to 28% and 9%, respectively, by allowing two and one standard multiplications.

Source: Electronics

DOI: 10.3390/electronics13244887

Authors: Geumtae Kim, Eunyoung Seo, Yongwoo Lee, Young-Sik Kim, Jong-Seon No

Institutions: Seoul National University, Daegu Gyeongbuk Institute of Science and Technology, Inha University

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,728

Funders: Iran Telecommunication Research Center, Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion