Vulnerable public keys in NTRU cryptosystem
From MaRDI portal
Publication:1997177
DOI10.1007/S11401-020-0225-6zbMATH Open1459.94148OpenAlexW3089363758MaRDI QIDQ1997177FDOQ1997177
Authors: Liqing Xu, Hao Chen, Chao Li, Longjiang Qu 
Publication date: 1 March 2021
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11401-020-0225-6
Recommendations
Cites Work
- BKZ 2.0: Better lattice security estimates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Making NTRU as secure as worst-case problems over ideal lattices
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Transcript secure signatures based on modular lattices
- Hardness of approximating the shortest vector problem in lattices
- Title not available (Why is that?)
- NTRU prime: reducing attack surface at low cost
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
Cited In (8)
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algebraic broadcast attack against NTRU
- Recovering NTRU Secret Key from Inversion Oracles
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- An algebraic algorithm for breaking NTRU with multiple keys
This page was built for publication: Vulnerable public keys in NTRU cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997177)
