Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic performance and conjectured resistance to quantum computers could make it a desirable alternative to factorisation and discrete-log based encryption schemes. However, since its

• Type: Journal
• Year: 2011
• Where: EUROCRYPT
• Authors: Damien Stehlé, Ron Steinfeld
• Keywords: Asymptotic Performance, Cryptology, Discrete Log, EUROCRYPT 2011, Quantum Computers