Vulnerable public keys in NTRU cryptosystem
From MaRDI portal
Publication:1997177
Recommendations
Cites work
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- BKZ 2.0: Better lattice security estimates
- Hardness of approximating the shortest vector problem in lattices
- Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Making NTRU as secure as worst-case problems over ideal lattices
- NTRU prime: reducing attack surface at low cost
- Practical lattice-based cryptography: \texttt{NTRUEncrypt} and \texttt{NTRUSign}
- Transcript secure signatures based on modular lattices
Cited in
(8)- scientific article; zbMATH DE number 2043328 (Why is no real title available?)
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- An algebraic algorithm for breaking NTRU with multiple keys
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- An algebraic broadcast attack against NTRU
- Recovering NTRU Secret Key from Inversion Oracles
- A lattice attack on homomorphic NTRU with non-invertible public keys
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
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)
