4 - Public Key Cryptography Flashcards

RSA

1
Q

Who first introduced the idea of Public key crypto?

A

Diffe & Hellman 1976/77

RSA 1977 still used

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

Public-key crypto relies on operations that are…

A

easy to do but hard to “undo”

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

RSA is based on the difficulty of…

A

factoring (easy to multiply, hard to factor)

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

Steps of public key

A

Each person has public/private
Alice -> Bob, encrypt with Bob public key and Bob decrypt with own private key

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

Possible attack, specific to pub0key

A

When there are not many possible plaintext,

attacker can encrypt all possible plaintext using Bob pub key and see what they intercept then match.

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

Setting up RSA Keys

A

p, q are large primes (150 digits plus)
n is p * q
r is (p-1)(q-1)

e is chosen between 2 and r-1 such that gcd(e,r) = 1

d such that ed mod r =1

Pub = (e,n)
Priv = (d,p,q)

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

Out of e,n,d,p,q, which of these are allocated to public/private key?

A

pub = (e,n)
priv = (d,p,q)

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

RSA - Plaintext and ciphertexts are integers between …

A

0 and n-1

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

To send message m to Bob (RSA), it should be encrypted as…

A

c = m^e mod n

e and n are from RSA steps

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

TO decrypt a message (RSA), Bob uses…

A

c^d mod n

d and n are from RSA steps

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

RSA’s current main use

A

Digital signatures

Not encryption or key exchange

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