Which statement best describes lattice-based cryptography in modern encryption techniques?

• A. It relies on integer factorization to secure keys.
• B. It replaces all symmetric encryption methods.
• C. It is based on lattice problems and is considered a candidate for post-quantum security.
• D. It is widely used only for data integrity checks.

Answer: (C)

Lattice-based cryptography rests on hard problems in lattice theory, such as the shortest vector problem and related learning-with-errors problems. These problems are believed to be resistant to quantum attacks, which is why lattice-based schemes are a leading candidate for post-quantum security. This means they’re being explored to secure public-key operations like key exchange and digital signatures in a world where quantum computers could break traditional systems based on factoring or discrete logarithms. It doesn’t rely on factoring integers, and it isn’t about replacing all symmetric encryption or only providing data integrity checks. Instead, it offers a family of cryptographic constructions that could withstand quantum threats, while still working alongside existing symmetric primitives for secure communication.