LLMpediaThe first transparent, open encyclopedia generated by LLMs

public-key cryptography

Generated by DeepSeek V3.2
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Expansion Funnel Raw 42 → Dedup 12 → NER 12 → Enqueued 12
1. Extracted42
2. After dedup12 (None)
3. After NER12 (None)
4. Enqueued12 (None)

public-key cryptography. Also known as asymmetric cryptography, it is a foundational framework for modern secure communication. It utilizes a pair of mathematically linked keys: a public key, which can be widely distributed, and a private key, which is kept secret by its owner. This system enables critical functions like encryption, digital signatures, and key exchange without requiring prior shared secrets between parties, addressing fundamental limitations of symmetric-key cryptography.

Overview

The concept was first publicly proposed by Whitfield Diffie and Martin Hellman in their seminal 1976 paper, though equivalent work was later revealed to have been conducted earlier at the Government Communications Headquarters. The core innovation is the use of a trapdoor one-way function, making certain computations easy in one direction but computationally infeasible to reverse without the private key. This paradigm underpins much of the security for the modern Internet, including protocols like Transport Layer Security and systems such as Pretty Good Privacy. Its development marked a revolutionary departure from the classical cryptosystems used throughout history, including those by Julius Caesar and the Enigma machine.

Principles of operation

A fundamental principle is the separation of the encryption and decryption capabilities into two distinct keys. For encryption, a message encrypted with a recipient's public key can only be decrypted with the corresponding private key held by that recipient. For creating digital signatures, a hash of a message is signed with a sender's private key, and anyone can verify this signature using the sender's public key, authenticating both the sender's identity and the message's integrity. The mathematical relationship between the keys is based on hard computational problems, such as integer factorization or the discrete logarithm problem, which are believed to be intractable for classical computers. The security of the entire system relies on the secrecy of the private key and the computational difficulty of deriving it from the public key.

Algorithms

The first widely adopted algorithm was the RSA (cryptosystem), invented by Ron Rivest, Adi Shamir, and Leonard Adleman at the Massachusetts Institute of Technology. Another crucial family is based on the discrete logarithm problem, including the Digital Signature Algorithm adopted by the National Institute of Standards and Technology and schemes used in Elliptic-curve cryptography, which offers equivalent security with smaller key sizes. The Diffie–Hellman key exchange protocol, a cornerstone for secure key establishment, was the first practical method for two parties to jointly establish a shared secret over an insecure channel. Other notable algorithms include ElGamal encryption and Cramer–Shoup cryptosystem.

Security

The security of these systems is not absolute but is based on computational assumptions and the current state of technology. The potential advent of large-scale Quantum computing poses a significant threat, as algorithms like Shor's algorithm could efficiently solve the underlying mathematical problems, breaking widely used systems. This has spurred the field of Post-quantum cryptography, with research into lattice-based, code-based, and multivariate cryptographic schemes. Real-world attacks often target implementations, side-channels, or poor key management rather than the core mathematical problems. Organizations like the National Security Agency and European Union Agency for Cybersecurity provide guidelines and certifications for secure deployment.

Applications

It is ubiquitous in securing digital communications and transactions. It forms the basis for the Transport Layer Security protocol that secures connections to websites like Google and Facebook, and for the Secure Shell protocol used for remote system administration. Digital signatures are essential for code signing by companies like Microsoft and Apple Inc., for legal documents under acts like the Electronic Signatures in Global and National Commerce Act, and for blockchain technologies such as Bitcoin. It also enables secure email via standards like S/MIME and underpins the public key infrastructure used by certificate authorities like DigiCert and Let's Encrypt.

History

The idea was conceived independently by several researchers. While Whitfield Diffie and Martin Hellman are credited with the first public invention, it was later disclosed that James H. Ellis, Clifford Cocks, and Malcolm J. Williamson at the Government Communications Headquarters had developed equivalent concepts years earlier, under the code name Non-Secret Encryption. The publication of the RSA (cryptosystem) algorithm in 1977 provided the first viable implementation for both encryption and signatures. The RSA Factoring Challenge and the Advanced Encryption Standard competition helped advance the field's understanding of security. Its adoption was accelerated by the rise of the Internet and advocacy from figures like Phil Zimmermann with the release of Pretty Good Privacy.

Category:Cryptography

Some section boundaries were detected using heuristics. Certain LLMs occasionally produce headings without standard wikitext closing markers, which are resolved automatically.