Efficient interleaved Montgomery modular multiplication for lattice-based cryptography

IEICE Electronics Express

Sedat Akleylek¹  Zaliha Yüce Tok² 

[1] Department of Computer Engineering, Ondokuz Mayıs University;Institute of Applied Mathematics, Middle East Technical University

关键词: interleaved Montgomery modular multiplication;    lattice-based cryptography;    NTRUEncrypt;    GPU implementation;   

DOI  :  10.1587/elex.11.20140960

学科分类：电子、光学、磁材料

来源: Denshi Jouhou Tsuushin Gakkai

【 摘 要 】

References(9)Cited-By(1)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 (�?/q�?)[x]/(xn �? 1) and (�?/p�?)[x]/(xn + 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 (�?/p�?)[x]/(xn + 1), where n �? {1024, 2048, 4096}.

【 授权许可】

Unknown