Vulnerable public keys in NTRU cryptosystem
From MaRDI portal
Publication:1997177
DOI10.1007/s11401-020-0225-6zbMath1459.94148OpenAlexW3089363758MaRDI QIDQ1997177
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NTRU prime: reducing attack surface at low cost
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Transcript Secure Signatures Based on Modular Lattices
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- BKZ 2.0: Better Lattice Security Estimates
- Hardness of approximating the shortest vector problem in lattices
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
This page was built for publication: Vulnerable public keys in NTRU cryptosystem