ARTICLEwords.filippo.io17 min read

Understanding the Impact of Quantum Computing on Cryptography

Understanding the Impact of Quantum Computing on Cryptography

AI Summary

The looming presence of quantum computers necessitates a shift from current asymmetric cryptographic methods, like ECDH and RSA, which are vulnerable to Shor’s algorithm. However, symmetric cryptography, including AES and SHA, remains secure against quantum threats. A common misconception suggests that quantum computers halve the security of symmetric keys, prompting unnecessary calls for 256-bit keys for 128-bit security. This misunderstanding stems from misapplying Grover’s algorithm, which does not practically reduce AES-128's security.

## Grover's Algorithm and Its Misinterpretation

Grover’s algorithm theoretically speeds up the search for an AES-128 key, but practical application shows this is not feasible. A sequential attack using Grover’s would take centuries, and parallelizing it increases the total computational cost, diluting the supposed speedup. For instance, a brute force attack on a 64-bit key can be efficiently parallelized, but Grover’s requires sequential steps, limiting its effectiveness.

## Running the Numbers

To break AES-128 using Grover’s, one would need 140 trillion quantum circuits running for a decade, making it vastly more expensive than breaking elliptic curves with Shor’s. This demonstrates that AES-128 remains secure, as confirmed by NIST, which uses it as a benchmark for post-quantum security.

## NIST and Global Consensus

NIST and other bodies like BSI affirm that AES-128 is secure against quantum threats. They emphasize that the real threat lies in asymmetric cryptography, not symmetric. NIST’s standards for symmetric cryptography, including AES, are robust against quantum attacks, and AES-128 is considered safe for decades.

## The Importance of Focused Transition

The push for post-quantum cryptography is crucial due to the risks to asymmetric systems. However, conflating this with unnecessary changes to symmetric cryptography could waste resources and create unnecessary complexity. Coordination is key, and focusing on necessary updates will prevent needless churn.

## Compliance and Practicality

While some compliance regimes, like CNSA 2.0, require 256-bit keys, this is not due to quantum computing concerns but rather a preference for uniform security levels. AES-256 is accepted, acknowledging Grover’s limitations. The real focus should be on transitioning asymmetric systems, as symmetric systems like AES-128 are already secure.

## Conclusion

The article concludes that while 256-bit keys may seem like a safety measure, they are often unnecessary for symmetric cryptography. The real work lies in updating asymmetric systems, and maintaining focus on this will ensure a smoother transition to post-quantum security.

Key Concepts

Quantum Computing

Quantum computing leverages the principles of quantum mechanics to process information in ways that classical computers cannot, potentially solving certain problems much faster.

Grover's Algorithm

Grover's algorithm is a quantum algorithm that provides a quadratic speedup for unstructured search problems, theoretically reducing the time to find a solution.

Category

Technology
M

Summarized by Mente

Save any article, video, or tweet. AI summarizes it, finds connections, and creates your to-do list.

Start free, no credit card