CybersecurityLesson 4 of 5 in the course Cryptography

RSA Cryptography: Keys, Operations, and Security

5 flashcards · 5 quiz questions · 5 match pairs · 4 fill-in sentences · English

Lesson progress
0 / 5

Your progress is kept in this browser only.Sign up to save it

Summary

This lesson introduces RSA, the idea of public-key cryptography, and the historical context in which RSA was developed. These foundations explain why RSA uses two related keys and how the system became a widely used cryptographic tool.

In a public-key cryptosystem, each user has a key pair: a public key that can be shared and a private key that must remain secret. This differs from a symmetric-key system, in which communicating parties share the same secret key.

All flashcards

What is an asymmetric cryptosystem?
A cryptosystem using mathematically related public and private keys for different operations; the public key may be shared, while the private key is kept secret.
What does RSA stand for?
RSA takes its name from Ron Rivest, Adi Shamir, and Leonard Adleman, who publicly described the system in 1977.
What is the integer factorization problem?
The problem of recovering the prime factors of a composite integer, such as finding pp and qq from n=pqn=pq.
What was Clifford Cocks’s role in the history of RSA?
Cocks developed a similar system secretly at GCHQ in 1973; the work was declassified in 1997.
Why use RSA in a hybrid cryptosystem?
RSA can protect a short symmetric key, while a faster symmetric cipher encrypts larger amounts of data.

Quiz questions

  1. Which scheme is recommended for RSA encryption in new applications?Answer: RSAES-OAEP, which uses randomized encoding for encryption.
  2. Which scheme is designed for RSA digital signatures?Answer: RSA-PSS, a probabilistic signature scheme.
  3. What security weakness results from raw RSA encryption being deterministic?Answer: An observer can compare repeated ciphertexts and test guesses about likely plaintexts.
  4. What is the main performance benefit of using the Chinese remainder theorem for RSA decryption?Answer: It replaces one large modular exponentiation with operations using smaller moduli.
  5. What can a padding-oracle attack exploit?Answer: Responses that reveal whether decrypted ciphertext passed padding validation.

Based on the Wikipedia article RSA cryptosystem, licensed CC BY-SA 4.0. Adapted into a summary, flashcards and quizzes.

All Cybersecurity lessons