Source Count: 15 | Weighted Score: 32 | Source Confidence: [4/5] | Primary Tier: 1 | Last Updated: April 12, 2026
Keywords: cryptography, RSA, elliptic curve, Diffie-Hellman, public key, symmetric encryption, AES, number theory, post-quantum cryptography, zero-knowledge proofs
Category Tags: mathematics, cryptography, information-security, number-theory, computation
Cross-References: V_4_17 — Quantum Computing Algorithms · V_4_01 — Discrete Mathematics Logic · V_2_01 — Number Theory

QUICK SUMMARY

Cryptography — the science of secure communication — rests on some of the deepest results in number theory, algebra, and computational complexity. Modern public-key cryptography was born in 1976 when Whitfield Diffie and Martin Hellman published their key exchange protocol, followed in 1977 by Ron Rivest, Adi Shamir, and Leonard Adleman's RSA algorithm, which exploits the computational difficulty of factoring large semiprimes. Symmetric ciphers like AES (adopted as a federal standard in 2001) and hash functions (SHA-256) underpin virtually all digital commerce, communication, and authentication. Elliptic curve cryptography (ECC), introduced independently by Neal Koblitz and Victor Miller in 1985, achieves equivalent RSA security with far shorter keys. The advent of quantum computing threatens RSA and ECC via Shor's algorithm (1994), driving NIST's Post-Quantum Cryptography standardization (first standards finalized in 2024). Cryptography intersects with information theory (Claude Shannon's 1949 proof that the one-time pad offers perfect secrecy), computational complexity (P vs. NP), and zero-knowledge proofs.

1. VERIFIED CLAIMS (Tier 1 — Peer-Reviewed / Established)

1.1 Public-Key Cryptography (Diffie-Hellman, 1976)

• Evidence: Whitfield Diffie and Martin Hellman published "New Directions in Cryptography" in November 1976, introducing the concept of public-key cryptography and the Diffie-Hellman key exchange protocol based on the discrete logarithm problem. This solved the fundamental key distribution problem that had plagued symmetric cryptography. They received the 2015 Turing Award. KEY FINDING In 1997, GCHQ declassified that James Ellis, Clifford Cocks, and Malcolm Williamson had independently discovered public-key cryptography and an RSA-equivalent algorithm at the UK Government Communications Headquarters in 1970–1973, but the work remained classified.
• Primary Source: Diffie, Whitfield and Martin Hellman. "New Directions in Cryptography." IEEE Transactions on Information Theory 22.6 (1976): 644–654. DOI: 10.1109/TIT.1976.1055638

1.2 RSA Algorithm (1977)

• Evidence: In 1977, Ron Rivest, Adi Shamir, and Leonard Adleman at MIT published the RSA algorithm, the first practical public-key encryption system. RSA security relies on the computational intractability of factoring the product of two large primes. As of 2024, the largest RSA number factored is RSA-250 (829 bits, factored in February 2020 using ~2,700 CPU-core-years). RSA-2048 (617 digits) remains secure; current estimates suggest classical factoring would require ~10²⁰ operations. Rivest, Shamir, and Adleman received the 2002 Turing Award.
• Primary Source: Rivest, Ronald, Adi Shamir, and Leonard Adleman. "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems." Communications of the ACM 21.2 (1978): 120–126. DOI: 10.1145/359340.359342

1.3 Shannon's Information-Theoretic Security (1949)

• Evidence: Claude Shannon proved in his classified 1945 report (declassified and published in 1949 as "Communication Theory of Secrecy Systems") that the one-time pad provides perfect secrecy — the ciphertext reveals absolutely no information about the plaintext, provided the key is truly random, at least as long as the message, never reused, and kept secret. This remains the only provably unbreakable encryption system. Shannon also proved that any perfectly secure cipher requires a key at least as long as the message.
• Primary Source: Shannon, Claude. "Communication Theory of Secrecy Systems." Bell System Technical Journal 28.4 (1949): 656–715. DOI: 10.1002/j.1538-7305.1949.tb00928.x

1.4 AES — The Advanced Encryption Standard (2001)

• Evidence: In October 2000, NIST selected the Rijndael cipher (designed by Belgian cryptographers Joan Daemen and Vincent Rijmen) as the Advanced Encryption Standard, replacing DES. AES operates on 128-bit blocks with key sizes of 128, 192, or 256 bits. No practical attack on full AES has been published; the best known attack on AES-256 (biclique, 2011) reduces the search space from 2²⁵⁶ to 2²⁵⁴·⁴, which is computationally insignificant. AES processes data on modern hardware at speeds exceeding 5 GB/s using AES-NI instructions.
• Primary Source: Daemen, Joan and Vincent Rijmen. The Design of Rijndael: AES — The Advanced Encryption Standard. Berlin: Springer, 2002. ISBN: 978-3-540-42580-9

1.5 Elliptic Curve Cryptography (1985)

• Evidence: Neal Koblitz (University of Washington) and Victor Miller (IBM) independently proposed elliptic curve cryptography in 1985, basing security on the elliptic curve discrete logarithm problem (ECDLP). A 256-bit ECC key provides security equivalent to a 3,072-bit RSA key, enabling faster operations and smaller key sizes — critical for constrained devices (smart cards, IoT). ECC is used in TLS 1.3, Bitcoin (secp256k1 curve), Signal Protocol, and most modern secure communications.
• Primary Source: Koblitz, Neal. "Elliptic Curve Cryptosystems." Mathematics of Computation 48.177 (1987): 203–209. DOI: 10.1090/S0025-5718-1987-0866109-5

2. CREDIBLE CLAIMS (Tier 2 — Academic / Debated but Supported)

2.1 Post-Quantum Cryptography Is Urgently Needed

• Evidence: Peter Shor proved in 1994 that a sufficiently powerful quantum computer could factor integers and compute discrete logarithms in polynomial time, breaking RSA, Diffie-Hellman, and ECC. NIST launched its Post-Quantum Cryptography standardization in 2016 and finalized the first standards in August 2024: CRYSTALS-Kyber (lattice-based key encapsulation, now ML-KEM) and CRYSTALS-Dilithium (lattice-based digital signature, now ML-DSA). The timeline for quantum threats remains debated — estimates for a cryptographically relevant quantum computer range from 2030 to "never" depending on the expert consulted.

2.2 Zero-Knowledge Proofs Enable Privacy-Preserving Verification

• Evidence: Shafi Goldwasser, Silvio Micali, and Charles Rackoff introduced zero-knowledge proofs in 1985, proving that a prover can convince a verifier of a statement's truth without revealing any additional information. ZK-SNARKs (Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge) are now deployed in cryptocurrency privacy (Zcash, launched 2016), blockchain scalability (Ethereum zk-rollups), and identity verification systems. Goldwasser and Micali received the 2012 Turing Award.

3. SPECULATIVE CLAIMS (Tier 3 — Possible but Unverified)

3.1 Lattice Problems May Not Be Truly Hard

• Evidence: Most post-quantum cryptographic schemes rely on the hardness of lattice problems (Learning With Errors, Shortest Vector Problem). While no efficient classical or quantum algorithm is known, the problems have not been proven hard — a breakthrough in lattice algorithms could compromise the entire post-quantum transition. The 2023 paper by Chris Peikert surveying lattice-based cryptography noted that "our confidence rests on decades of failed attacks, not on proofs of hardness."

3.2 Homomorphic Encryption Could Enable Computation on Encrypted Data

• Evidence: Craig Gentry constructed the first fully homomorphic encryption (FHE) scheme in his 2009 Stanford PhD thesis, allowing arbitrary computation on encrypted data without decryption. While mathematically proven possible, FHE remains 10,000–100,000× slower than plaintext computation despite significant optimization. Practical deployment remains limited to narrow applications.

4. DUBIOUS CLAIMS (Tier 4 — No Credible Source / Contradicted by Evidence)

4.1 Quantum Computers Have Already Broken RSA

• DEBUNKED As of 2025, no quantum computer has factored any cryptographically relevant number. IBM's 1,121-qubit Condor processor (2023) and Google's 105-qubit Willow (2024) are far from the estimated ~4,000+ logical qubits needed to break RSA-2048. The widely cited 2022 Chinese preprint claiming RSA-2048 could be broken with 372 qubits was critiqued by Scott Aaronson and others as relying on unverified heuristic algorithms.

Counter-Arguments & Criticisms

Cryptographic security is always conditional — it depends on computational assumptions (factoring is hard, discrete log is hard) that have never been proven, even classically. The P vs. NP problem, if resolved with P = NP, would invalidate most public-key cryptography. Bruce Schneier has repeatedly argued that implementation flaws (side-channel attacks, poor random number generators, protocol bugs) break more real-world systems than mathematical weaknesses. The NSA's suspected backdoor in the Dual_EC_DRBG random number generator (confirmed by the Snowden documents in 2013) demonstrated that even standardized algorithms can be compromised by state actors. Additionally, the "harvest now, decrypt later" threat — where adversaries collect encrypted traffic today to decrypt when quantum computers are available — is already driving early migration to post-quantum standards.

IMAGES

No images assigned yet.

BIBLIOGRAPHY

1. Diffie, Whitfield; Martin Hellman | 1976 | "New Directions in Cryptography" | IEEE Transactions on Information Theory | ∅ | 22.6::644–654 | ∅ | ∅ | doi:10.1109/TIT.1976.1055638 | ∅ | ∅ | ∅
2. Rivest, Ronald, Adi Shamir; Leonard Adleman | 1978 | "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems" | Communications of the ACM | ∅ | 21.2::120–126 | ∅ | ∅ | doi:10.1145/359340.359342 | ∅ | ∅ | ∅
3. Shannon, Claude | 1949 | "Communication Theory of Secrecy Systems" | Bell System Technical Journal | ∅ | 28.4::656–715 | ∅ | ∅ | doi:10.1002/j.1538-7305.1949.tb00928.x | ∅ | ∅ | ∅
4. Koblitz, Neal | 1987 | "Elliptic Curve Cryptosystems" | Mathematics of Computation | ∅ | 48.177::203–209 | ∅ | ∅ | doi:10.1090/S0025-5718-1987-0866109-5 | ∅ | ∅ | ∅
5. Shor, Peter. : 124 134 | 1994 | "Algorithms for quantum computation: discrete logarithms and factoring" | Proceedings of the 35th Annual Symposium on Foundations of Computer Science | ∅ | ∅ | ∅ | ∅ | doi:10.1109/SFCS.1994.365700 | ∅ | ∅ | ∅
6. Goldwasser, Shafi, Silvio Micali; Charles Rackoff | 1989 | "The Knowledge Complexity of Interactive Proof Systems" | SIAM Journal on Computing | ∅ | 18.1::186–208 | ∅ | ∅ | doi:10.1137/0218012 | ∅ | ∅ | ∅
7. Daemen, Joan; Vincent Rijmen | 2002 | ∅ | The Design of Rijndael: AES — The Advanced Encryption Standard | ∅ | ∅ | Berlin: Springer | ∅ | isbn:9783540425809 | ∅ | ∅ | ∅
8. Gentry, Craig. : 169 178 | 2009 | "Fully homomorphic encryption using ideal lattices" | Proceedings of the 41st ACM Symposium on Theory of Computing | ∅ | ∅ | ∅ | ∅ | doi:10.1145/1536414.1536440 | ∅ | ∅ | ∅
9. Bernstein, Daniel; Tanja Lange | 2017 | "Post-quantum cryptography" | Nature | ∅ | 549::188–194 | ∅ | ∅ | doi:10.1038/nature23461 | ∅ | ∅ | ∅
10. Katz, Jonathan; Yehuda Lindell | 2020 | ∅ | Introduction to Modern Cryptography | ∅ | ∅ | Boca Raton: CRC Press | 3rd | isbn:9780815354369 | ∅ | ∅ | ∅
11. Singh, Simon | 1999 | ∅ | The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography | ∅ | ∅ | New York: Anchor Books | ∅ | isbn:9780385495325 | ∅ | ∅ | ∅
12. Schneier, Bruce | 1996 | ∅ | Applied Cryptography: Protocols, Algorithms, and Source Code in C | ∅ | ∅ | New York: Wiley | 2nd | isbn:9780471117094 | ∅ | ∅ | ∅
13. Stinson, Douglas | 2018 | ∅ | Cryptography: Theory and Practice | ∅ | ∅ | Boca Raton: CRC Press | 4th | isbn:9781138197015 | ∅ | ∅ | ∅
14. Menezes, Alfred, Paul van Oorschot; Scott Vanstone | 1996 | ∅ | Handbook of Applied Cryptography | ∅ | ∅ | Boca Raton: CRC Press | ∅ | isbn:9780849385230 | ∅ | ∅ | ∅
15. Peikert, Chris | 2016 | "A Decade of Lattice Cryptography" | Foundations and Trends in Theoretical Computer Science | ∅ | 10.4::283–424 | ∅ | ∅ | doi:10.1561/0400000074 | ∅ | ∅ | ∅

CROSS-REFERENCE INDEX

Generated from V4 expansion plan. Last Updated: April 12, 2026