On NTRU and its performance

Abstract

Hardness of lattice problems has introduced a new candidate for public key cryptosystems. NTRU is one of such cryptosystems. The fact that it works with small integers and that the complexities of key generation, encryption and decryption are relatively small leads to good overall performance when compared to the other public key cryptosystems. The aim of this study is to make a theoretical to practical introduction to NTRU and investigate how it performs against popular public key cryptosystems such as RSA and, especially, ECC. © 2008 Atilla Elçi.