Choosing parameters for NTRUEncrypt

DOI10.1007/978-3-319-52153-4_1MaRDI QIDQ2975792zbMATH OpenOpenAlexFDO

Authors Jeff Hoffstein, Jill Pipher, Joseph H. Silverman, William Whyte, Zhenfei Zhang, John M. Schanck

Publication date 12 April 2017

Published in Topics in Cryptology – CT-RSA 2017 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-52153-4_1

zbMATH Keywords

cryptanalysisparameter derivationpublic-key cryptography/NTRUEncrypt

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Making NTRU as secure as worst-case problems over ideal lattices
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
• New Chosen-Ciphertext Attacks on NTRU
• Provably secure NTRUEncrypt over any cyclotomic field

Cites work

• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• BKZ 2.0: Better lattice security estimates
• Choosing parameters for NTRUEncrypt
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• Lattice signatures and bimodal Gaussians
• Making NTRU as secure as worst-case problems over ideal lattices
• Optimizations for NTRU
• Predicting Lattice Reduction
• Random small Hamming weight products with applications to cryptography
• Topics in Cryptology – CT-RSA 2005

Cited in

(24)

• NTRU prime: reducing attack surface at low cost
• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
• Achievable upper bound for the sup-norm of the product of elements of the ring of truncated polynomials and its application to the analysis of NTRU-like cryptosystems
• Modular lattice signatures, revisited
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
• The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• A key recovery attack on MDPC with CCA security using decoding errors
• Choosing parameters for NTRUEncrypt
• Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
• A new method for developing signature algorithms on finite non-commutative algebras
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• NTRU over Galois rings
• On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
• Compact lattice gadget and its applications to hash-and-sign signatures
• NTRU in Quaternion Algebras of Bounded Discriminant
• Polynomial-time key-recovery attacks against \texttt{NTRUReEncrypt} from ASIACCS'15
• A probability inequality with application to lattice theory
• A generalization of NTRUEncrypt
• An algebraic algorithm for breaking NTRU with multiple keys
• DiTRU: a resurrection of NTRU over dihedral group
• Improved provable reduction of NTRU and hypercubic lattices
• An improved practical key mismatch attack against NTRU
• Optimizing variance for reliability decryption in NTRUEncrypt

Describes a project that uses

Uses Software

• NTRU
• BKZ
• GitHub

This page was built for publication: Choosing parameters for NTRUEncrypt

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975792)