Proposed Development of NTRU Public Key Encryption

Abstract

The 1996 proposal by Hoffstein, Pfeiffer, and Silverman for the NTRU public key encryption system provides a quick and useful substitute for factorization- or discrete logarithm-based classical programs. It rovides approximate security against quantum computing assaults and earoptimal asymptotic efficiency, in contrast to these latter approaches. The security analysis of the system involves examining naturally occurring computational and statistical challenges that are defined on finite polynomial rings. Current advancements in the broader field of latticebased cryptography, include security studies and applications of NTRU and its variations. These advancements include the creation of multilinear.