Analytical study of implementation issues of NTRU

Abstract

N th -Dimensional Truncated Polynomial Ring (NTRU) is a lattice-based public-key cryptosystem that offers encryption and digital signature solutions. It was designed by Silverman, Hoffstein and Pipher. The NTRU cryptosystem was patented by NTRU Cryptosystems Inc. (which was later acquired by Security Innovations) and available as IEEE 1363.1 and X9.98 standards. NTRU is resistant to attacks based on Quantum computing, to which the standard RSA and ECC public-key cryptosystems are vulnerable to. In addition, NTRU has higher performance advantages over these cryptosystems.Considering this importance of NTRU, it is highly recommended to adopt NTRU as part of a cipher suite along with widely used cryptosystems for internet security protocols and applications. In this paper, we present our analytical study on the implementation of NTRU encryption scheme which serves as a guideline for security practitioners who are novice to latticebased cryptography or even cryptography. In particular, we show some non-trivial issues that should be considered towards a secure and efficient NTRU implementation.

Pengamanan Data Teks Dengan NTRU dan Modulus Function pada Koefisien IHWT Citra Warna

“…Pendekatan yang dilakukan untuk menghasilkan algoritma NTRU adalah dengan menggunakan struktur matematika polynomial ring 𝑍[𝑋] (𝑋 𝑁 − 1) ⁄ . Algoritma dapat digambarkan sebagai berikut [10]: 1. Plaintext diubah dahulu ke dalam bentuk polynomial m 2.…”