Efficient interleaved Montgomery modular multiplication for lattice-based cryptography

Download
2014-01-01
AKLEYLEK, SEDAT
Tok, Zaliha Yuce
In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed method. We receive at least 19% improvement with the proposed method for the polynomial multiplication in (Z/pZ)[x]/(x(n) + 1), where n is an element of{1024, 2048, 4096}.

Citation Formats
S. AKLEYLEK and Z. Y. Tok, “Efficient interleaved Montgomery modular multiplication for lattice-based cryptography,” IEICE ELECTRONICS EXPRESS, vol. 11, no. 22, pp. 0–0, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64696.