Week 14 Flashcards

1
Q

Appreciate that, in practice, public-key encryption is largely used for the encryption of symmetric keys

(Outline how Alice sends a message to Bob using a hybrid approach - 4 steps)

A

Yes appreciate šŸ™

  1. Alice encrypts her message with a symmetric encryption scheme, using the key k to produce ciphertext c
  2. Bob provides Alice with his public encryption key, e, and public param, n, so she can encrypt k using the RSA encryption scheme, producing ciphertext ke (mod n)
  3. Once Bob receives c and ke (mod n), he can use his private decryption key d to find **(ke)dā‰” k (mod n) **
  4. k is the symmetric scheme key, so Bob can then decrypt c with it and recover the message
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Define the One-Way goal for attacking a public-key encryption scheme

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Give an informal definition of semantic security of a public-key encryption scheme

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define a chosen plaintext attack on a public-key encryption scheme

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define a chosen ciphertext attack on a public-key encryption scheme

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Appreciate that RSA is One-Way secure against chosen plaintext attacks provided that the RSA problem is difficult to solve

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Prove that RSA is not One-Way secure against chosen ciphertext attacks

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Demonstrate how to compute the Jacobi symbol of a of a message m modulo an RSA modulus n, given only n, e and me (mod n)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe why a Fermat Prime makes a convenient choice for an RSA encryption key

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly