On the ideal shortest vector problem over random rational primes

DOI10.1007/978-3-030-77870-5_20zbMath1479.94241arXiv2004.10278MaRDI QIDQ2056701

Qi Cheng, Yanbin Pan, Nick Wadleigh, Jun Xu

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/2004.10278

zbMATH Keywords

ideal lattice; ring-LWE; average case computational complexity; lattice-based cryptosystems

Mathematics Subject Classification ID

94A60: Cryptography

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q12: Quantum algorithms and complexity in the theory of computing