Characterizing overstretched NTRU attacks

DOI10.1515/jmc-2015-0055zbMath1448.94241OpenAlexW3036715653MaRDI QIDQ2191207

Barak Shani, Gabrielle De Micheli, Nadia Heninger

Publication date: 24 June 2020

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2015-0055

zbMATH Keywords

overstretched NTRUsubfield attacksubring attack

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• NTRU
• NTRUSign

Cites Work

• A hierarchy of polynomial time lattice basis reduction algorithms
• Distribution of inverses in polynomial rings
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Random Walk: A Modern Introduction
• Candidate Multilinear Maps from Ideal Lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing overstretched NTRU attacks