Message recovery attack on NTRU using a lattice independent from the public key
From MaRDI portal
Publication:6646790
DOI10.3934/amc.2023040MaRDI QIDQ6646790
Marios Adamoudis, Konstantinos A. Draziotis
Publication date: 3 December 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
latticesLLL algorithmpublic key cryptographyclosest vector problemNTRU cryptosystemBabai's nearest plane algorithm
Could not fetch data.
Cites Work
- On Lovász' lattice reduction and the nearest lattice point problem
- Cold boot attacks on NTRU
- NTRU prime: reducing attack surface at low cost
- Enhancing an attack to DSA schemes
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Geometry of numbers
- On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- 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
- Algebraic attack on NTRU using Witt vectors and Gröbner bases
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- High-Speed Key Encapsulation from NTRU
- Security in Communication Networks
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- New Chosen-Ciphertext Attacks on NTRU
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Message recovery attack on NTRU using a lattice independent from the public key
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646790)
