Asymmetric
A term describing a system, process, or relationship where two or more parts are not identical, equal, or interchangeable. In computer science, it most commonly refers to asymmetric cryptography (public-key cryptography), which uses a pair of different keys for encryption and decryption.
1976
2
Definitions
In Cryptography
Asymmetric cryptography, also known as public-key cryptography, is a system that uses a pair of keys to secure information. These keys are mathematically related but are not the same.
Key Concepts
- Key Pair: Consists of a Public Key and a Private Key.
- Public Key: This key can be shared freely with anyone. It is used to encrypt data or to verify a digital signature.
- Private Key: This key must be kept secret by its owner. It is used to decrypt data that was encrypted with the public key or to create a digital signature.
How It Works
The fundamental principle is that a message encrypted with a public key can only be decrypted by its corresponding private key. This one-way relationship allows for secure communication without needing to share a secret key beforehand.
Example: If Alice wants to send a secure message to Bob, she finds Bob's public key (which he has shared openly) and uses it to encrypt her message. The resulting ciphertext can be sent over an insecure channel. Even if intercepted, it cannot be read by anyone except Bob, because only he possesses the private key required for decryption.
Common Usages
- Confidentiality: Encrypting data to ensure only the intended recipient can read it (e.g., PGP email encryption).
- Authentication & Non-Repudiation: Creating digital signatures with a private key proves the sender's identity and ensures they cannot later deny sending the message.
- Key Exchange: Used to securely exchange a secret key for a faster symmetric encryption algorithm. This is how protocols like SSL/TLS establish secure web sessions.
In General Computing & Networking
Beyond cryptography, the term asymmetric describes any system where components or data flows are unequal or operate differently in opposite directions.
Examples
-
Asymmetric Digital Subscriber Line (ADSL): This is a common type of internet connection where the bandwidth is uneven. The download speed (data coming to the user) is much higher than the upload speed (data going from the user). This design is efficient for typical consumer use, which involves more content consumption (downloading) than content creation (uploading).
-
Asymmetric Multiprocessing (AMP): In this computer architecture, multiple CPUs are used, but they are not treated equally. One or more processors might be dedicated to running the operating system or specific hardware tasks, while the others are available for user applications. This contrasts with Symmetric Multiprocessing (SMP), where any processor can handle any task, providing a more balanced workload distribution.
Origin & History
Etymology
From the Greek 'asymmetros', where 'a-' means 'not' and 'symmetros' means 'symmetrical' or 'of like measure'. It literally means 'not symmetrical'.
Historical Context
The concept of **asymmetric** cryptography was a revolutionary breakthrough that solved the fundamental problem of key distribution that plagued symmetric cryptography. For centuries, two parties wanting to communicate securely had to first find a secure way to exchange a secret key. This changed in 1976 with the publication of the paper "New Directions in Cryptography" by Whitfield Diffie and Martin Hellman. They introduced the groundbreaking concept of **public-key** cryptography, a system where keys could be exchanged over an insecure channel. Their work laid the theoretical foundation for a new era of secure communications. In 1977, Ron Rivest, Adi Shamir, and Leonard Adleman at MIT developed the RSA algorithm, the first practical and widely adopted implementation of an **asymmetric** cryptosystem. It remains a cornerstone of internet security today. Interestingly, it was later declassified that British intelligence agency GCHQ had independently developed a similar **non-symmetric** system. In the early 1970s, James H. Ellis conceived the idea, and Clifford Cocks developed a practical algorithm equivalent to RSA, but their work was kept secret and had no impact on the public development of the technology.
Usage Examples
In modern web security, SSL/TLS protocols use asymmetric cryptography to securely exchange a session key, which is then used for faster symmetric encryption.
The developer created a digital signature for the software release using their private key, allowing users to verify its authenticity with the corresponding public key, a core feature of public-key systems.
My internet connection is asymmetric; the download speed is significantly faster than the upload speed, which is typical for consumer-grade ADSL services.
Frequently Asked Questions
What is the primary difference between asymmetric and symmetric cryptography?
The primary difference lies in the keys used. Symmetric cryptography uses a single, shared secret key for both encryption and decryption. In contrast, asymmetric cryptography uses a pair of mathematically linked keys: a public key to encrypt data and a private key to decrypt it. This eliminates the challenge of securely sharing a single key between parties.
Why is asymmetric encryption often called public-key cryptography?
It is called public-key cryptography because one of the keys in the pair, the public key, is designed to be distributed openly without compromising security. Anyone can use this public key to encrypt a message for the key's owner, but only the owner, who holds the corresponding private key, can decrypt and read the message.