badge icon

This article was automatically translated from the original Turkish version.

Article

Post-Quantum Cryptography

Post-quantum cryptography encompasses cryptographic algorithms designed to be resistant to the threats posed by quantum computers. These algorithms can be executed on classical classical computers and are resilient against quantum attacks. USA The National Institute of Standards and Technology (NIST) is conducting a comprehensive process to standardize post-quantum cryptographic algorithms.


Post-Quantum Cryptography — Generated by artificial intelligence

Impact of Quantum Computers on Cryptography

Shor’s Algorithm and Its Effects on RSA and ECC

Shor’s algorithm enables quantum computers to perform integer factorization, particularly of large prime numbers, far more efficiently than classical computers. This capability undermines the security of RSA and Elliptic Curve Cryptography (ECC) such as algorithms. Today, the security of these algorithms relies on the computational difficulty of factoring large numbers, a problem that quantum computers can solve effectively.

Grover’s Algorithm and Threats to Symmetric Encryption

Grover’s algorithm is a quantum algorithm used for searching unstructured databases. Symmetric encryption methods, particularly standards such as AES, are more resistant to Grover’s algorithm. However, quantum computers can reduce the effective security level of algorithms like AES-256, necessitating the use of larger key key sizes.

Algorithms Used in Post-Quantum Cryptography

  1. Lattice-Based Cryptography: Lattice-based cryptography relies on mathematical problems related to lattices, which remain difficult even for quantum computers to solve.
  2. Multi-Variate Polynomial-Based Cryptography: This approach is based on systems of multi-variate polynomial equations that are hard to solve and is particularly useful for digital signatures.
  3. Hash-Based Cryptography: Hash-based encryption systems are resistant to quantum attacks, especially for digital signatures. Merkle trees are an example of such algorithms.
  4. Code-Based Cryptography: Code-based encryption relies on the mathematical properties of error-correcting codes. The McEliece algorithm is one of the best-known examples of this method and is considered highly secure against quantum attacks.

Current Status of Post-Quantum Cryptography

Research Efforts by Major Technology Companies and Governments

Major technology companies such as Google, IBM, and Microsoft are making significant investments in post-quantum cryptography research. Additionally, the process of identifying quantum-safe algorithms continues through competitions organized by NIST.

Quantum-Safe Networks and Quantum Key Distribution (QKD)

Quantum key distribution (QKD) is a method that enables secure communication by leveraging principles of quantum mechanics. Countries such as China, Europe and the United States are making substantial investments in this technology.


The advancement of quantum computers poses a threat to current cryptographic methods. As a result, post-quantum cryptography research is gaining increasing importance attention. Current measures that can be taken include adopting hybrid systems, transitioning to larger long key sizes, and testing post-quantum algorithms. In the future, it is expected that quantum-resistant algorithms approved by NIST will become widely adopted.

Author Information

Avatar
AuthorOğuzhan YetimhellaçDecember 23, 2025 at 8:24 AM

Tags

Discussions

No Discussion Added Yet

Start discussion for "Post-Quantum Cryptography" article

View Discussions

Contents

  • Impact of Quantum Computers on Cryptography

    • Shor’s Algorithm and Its Effects on RSA and ECC

    • Grover’s Algorithm and Threats to Symmetric Encryption

  • Algorithms Used in Post-Quantum Cryptography

  • Current Status of Post-Quantum Cryptography

    • Research Efforts by Major Technology Companies and Governments

    • Quantum-Safe Networks and Quantum Key Distribution (QKD)

Ask to Küre