Revisiting lower dimension lattice attacks on NTRU

DOI10.1016/j.ipl.2022.106353OpenAlexW4313650487MaRDI QIDQ2681396

Zishen Zhao, Qing Ye

Publication date: 3 February 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106353

zbMATH Keywords

cryptographylattice attackshort vectorNTRUkey-recovery attack

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the success probability of solving unique SVP via BKZ
• A refined analysis of the cost for solving LWE via uSVP
• Revisiting the expected cost of solving uSVP and applications to LWE
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Hardness of approximating the shortest vector problem in lattices
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
• Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
• Lattice-Based Public-Key Cryptography in Hardware
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: Revisiting lower dimension lattice attacks on NTRU