Cyberstudy
PDF p.53 In progress

Asymmetric Encryption

Open PDF at p.53 19 flashcards

Summary

PDF p.53

Asymmetric encryption uses a pair of related keys (public and private) for encryption and decryption. The public key encrypts the message, and only the corresponding private key can decrypt it. This method ensures secure communication even if the public key is widely distributed. Asymmetric encryption is computationally intensive, so it is often used to encrypt symmetric keys for bulk data encryption.

In plain words

Supplementary — not from your PDF

Asymmetric encryption uses a matched pair of keys: a public key you can give anyone, and a private key you keep secret. Anything locked with the public key can only be opened with the private key.

Detailed explanation

PDF p.53
  • Asymmetric Encryption
    • Definition: Uses two different but related keys (public and private) for encryption and decryption.
    • Key Pair: Public key encrypts the message; private key decrypts it.
    • Security: Public key cannot be used to decrypt the ciphertext, ensuring secure communication.
  • Process
    • Key Generation: Bob generates a key pair and keeps the private key secret.
    • Public Key Distribution: Bob publishes the public key.
    • Message Encryption: Alice uses Bob's public key to encrypt a message.
    • Message Transmission: Alice sends the ciphertext to Bob.
    • Message Decryption: Bob decrypts the message using his private key.
    • Security Assurance: Even if Mallory intercepts the public key and ciphertext, they cannot decrypt the message.
  • Efficiency
    • Computational Overhead: Asymmetric encryption is more computationally intensive than symmetric encryption.
    • Hybrid Approach: Often used to encrypt a symmetric key, which is then used for bulk data encryption.
  • Algorithms
    • RSA (Rivest, Shamir, Adelman): Requires a 2,048-bit private key for acceptable security.
    • ECC (Elliptic Curve Cryptography): Uses 256-bit private keys for security equivalent to a 3,072-bit RSA key.

Important terms

taken from the text above
Asymmetric Encryption
Uses two different but related keys (public and private) for encryption and decryption.
Key Pair
Public key encrypts the message; private key decrypts it.
Key Generation
Bob generates a key pair and keeps the private key secret.
Public Key Distribution
Bob publishes the public key.
Message Encryption
Alice uses Bob's public key to encrypt a message.
Message Transmission
Alice sends the ciphertext to Bob.
Message Decryption
Bob decrypts the message using his private key.
Security Assurance
Even if Mallory intercepts the public key and ciphertext, they cannot decrypt the message.
Computational Overhead
Asymmetric encryption is more computationally intensive than symmetric encryption.
Hybrid Approach
Often used to encrypt a symmetric key, which is then used for bulk data encryption.
RSA (Rivest, Shamir, Adelman)
Requires a 2,048-bit private key for acceptable security.
ECC (Elliptic Curve Cryptography)
Uses 256-bit private keys for security equivalent to a 3,072-bit RSA key.

Examples & real-world scenarios

Supplementary — not from your PDF
  • Alice encrypts with Bob's public key; only Bob's private key can decrypt.
  • RSA needs about 2,048-bit keys; ECC gets similar strength with far smaller keys.
  • It's used to protect a symmetric key rather than bulk data.

Scenario

A website wants any visitor to send it data privately without meeting first. It publishes a public key (in its certificate), and visitors use it to protect a session key that then encrypts the traffic.

Common mistakes

Supplementary — not from your PDF
  • Encrypting with your own private key when you want confidentiality. That's how you sign, not how you keep something secret.
  • Using asymmetric encryption for large files. It's slow; use a hybrid approach.

Practical skills

Supplementary — not from your PDF
  • State which key to use for confidentiality and which for signing.

What I should remember

Key Points PDF p.53
  • Asymmetric Encryption
    • Two Keys: Public key for encryption, private key for decryption.
    • Secure Communication: Public key distribution does not compromise security.
  • Process
    • Key Pair Generation: Bob generates and keeps private key secret.
    • Public Key Use: Alice encrypts message with Bob's public key.
    • Decryption: Bob uses private key to decrypt message.
    • Security: Interception of public key and ciphertext does not compromise message.
  • Efficiency
    • Computationally Intensive: More overhead than symmetric encryption.
    • Hybrid Use: Encrypts symmetric keys for bulk data encryption.
  • Algorithms
    • RSA: 2,048-bit private key.
    • ECC: 256-bit private key for high security.