@inbook{a90c2f084080476eb499092caf1230e7,

title = "NTRU cryptosystem: recent developments and emerging mathematical problems in finite polynomial rings",

abstract = "The NTRU public-key cryptosystem, proposed in 1996 by Hoffstein, Pipher, and Silverman, is a fast and practical alternative to classical schemes based on factorization or discrete logarithms. In contrast to the latter schemes, it offers quasi-optimal asymptotic efficiency and conjectured security against quantum computing attacks. The scheme is defined over finite polynomial rings, and its security analysis involves the study of natural statistical and computational problems defined over these rings. We survey several recent developments in both the security analysis and in the applications of NTRU and its variants, within the broader field of lattice-based cryptography. These developments include a provable relation between the security of NTRU and the computational hardness of worst-case instances of certain lattice problems, and the construction of fully homomorphic and multilinear cryptographic algorithms. In the process, we identify the underlying statistical and computational problems in finite rings.",

keywords = "NTRU cryptosystem, lattice-based cryptography, fully homomorphic encryption, multilinear maps",

author = "Ron Steinfeld",

year = "2014",

doi = "10.1515/9783110317916.179",

language = "English",

isbn = "9783110317886",

series = "Radon Series on Computational and Applied Mathematics",

publisher = "De Gruyter",

pages = "179--212",

editor = "Harald Niederreiter and Ostafe, {Alina } and Daniel Panario and Winterhof, {Arne }",

booktitle = "Algebraic curves and finite fields",

address = "Germany",

}