Quantum security analysis of Module-LWE PQC based on practical cost estimates

The security of lattice-based cryptography relies on the computational complexity of solving the Shortest Vector Problem (SVP) on a high-dimensional lattice. Due to its efficacy in addressing SVP, lattice-based cryptographic systems have so far used the sieve algorithm to analyze their security. Pr...

Full description

Bibliographic Details

Published in:	Transactions on Cryptographic Hardware and Embedded Systems
Main Authors:	Seong-Min Cho, Changyeol Lee, Seung-Hyun Seo
Format:	Article
Language:	English
Published:	Ruhr-Universität Bochum 2025-09-01
Subjects:	Quantum computing Post-Quantum Cryptography Quantum Error Correction
Online Access:	https://tches.iacr.org/index.php/TCHES/article/view/12417