💻Asymmetric Encryption

Public and private keys (RSA, Elliptic Curves). Two linked keys for secure exchange

Article body and graph labels may still appear in Russian where English translations have not been added yet.

📖4 min read📊Level 5🗺️6 subtopics📅April 16, 2026

Loading map...

RSA (Rivest-Shamir-Adleman)
Asymmetric algorithm based on the difficulty of factoring large numbers. Public key (n, e), private key (n, d). Encryption: c = m^e mod n. Invented in 1977. Key sizes 2048-4096 bits. Applications: digital signatures, TLS
RSA Encryption
The first practical public key system (1977, Rivest-Shamir-Adleman). Based on the difficulty of factorization, it uses key sizes of 2048-4096 bits. Used for key exchange and digital signatures.
Elliptic Curve Cryptography (ECC)
Asymmetric cryptography based on elliptic curves (1985). Provides the same security with smaller keys (256-bit ECC ≈ 3072-bit RSA). Includes ECDSA and ECDH. A standard for mobile devices.
Diffie-Hellman
Key exchange protocol over an unsecured channel (1976). Based on the difficulty of discrete logarithm. Alice and Bob generate a shared secret without transmission. Used in TLS, IPsec. Vulnerable to MITM without authentication
ECC (Elliptic Curve Cryptography)
Cryptography based on elliptic curves. Smaller key size (256 bits ECC ≈ 3072 bits RSA). Faster and more efficient. Examples: ECDSA (signatures), ECDH (key exchange). Used in Bitcoin, TLS 1.3
ElGamal
Asymmetric algorithm based on discrete logarithm (1985). Similar to Diffie-Hellman. Used for encryption and digital signatures. Randomized encryption (different ciphertexts for the same message)

Асимметричное шифрование - важная область знаний.

🔗Learn more