Information Security Basics

When sending a large file encrypted to someone, which procedure describes the commonly used hybrid encryption scheme?

  1. AEncrypt the file directly with the recipient's public key, without using symmetric-key cryptography
  2. BEncrypt the file with a symmetric key and send that key unencrypted together with the file
  3. CEncrypt the file with a one-time symmetric key, encrypt that symmetric key with the recipient's public key, and send them together
Show answer and explanation

Answer: C. Encrypt the file with a one-time symmetric key, encrypt that symmetric key with the recipient's public key, and send them together

Public-key cryptography makes key distribution easy, but its computation is heavy and it is not suited to encrypting large data. Symmetric-key cryptography is fast, but getting the key safely to the other party is the challenge. Hybrid encryption combines their strengths: the data itself is encrypted quickly with a one-time symmetric key (session key) generated on the spot, and only that short symmetric key is encrypted with the recipient's public key and sent along. The recipient recovers the symmetric key with their own private key and uses it to decrypt the data. This is used, for example, in email encryption. In TLS the mainstream approach is for both sides to derive the same symmetric key through a key exchange instead of sending it encrypted with a public key, but the idea is the same: use public-key techniques to set up the symmetric key safely, and protect the data with symmetric-key cryptography.

  • A. Public-key cryptography is computationally heavy, so it is not suited to encrypting large data directly.
  • B. Sending the symmetric key as is would let anyone who intercepts it decrypt the file.
  • C. Correct. The data is protected by fast symmetric-key cryptography, and the key handover by public-key cryptography.
Practice this topic Back to topic

Related calculators

Books on Information Security Basics Ad

As an Amazon Associate I earn from qualifying purchases.

More Information Security Basics questions

  1. Which statement correctly describes a property of hash functions used in cryptography (cryptographic hash functions)?
  2. For an ideal hash function with a 256-bit output, which combination gives the approximate number of computations needed for a brute-force attack in two cases: finding an input that produces a given hash value (a preimage attack), and finding any two different inputs that produce the same hash value (a collision attack)?
  3. When a web service stores users' passwords, it adds a random value that differs for each user (a salt) to the password before computing and storing the hash value. What is the main purpose of the salt?
  4. For storing passwords, it is recommended not to use a fast hash function such as SHA-256 directly but a scheme deliberately designed to take time to compute, such as bcrypt or Argon2. Why?
  5. An 8-character password is searched for by brute force, trying every candidate. If 1×10^10 candidates can be tried per second, which combination is closest to the time needed to try all candidates for a password made only of lowercase letters (26 kinds) and one made of uppercase letters, lowercase letters and digits (62 kinds)?