Asymmetric Cryptography Flashcards

1
Q

Distributing secret keys is hard and expensive

A

Key distribution issues

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

Find y such that b^y mod p = x given x

A

Discrete log problem

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

$p$, $g < p$ group generator

A

public parameters of DH

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  1. Pick a from [0, p-1)
  2. Pick b from [0, p-1)
  3. A -> B: g^a mod p
  4. B -> A: g^b mod p
  5. k = g^ab mod p
A

Diffie Hellman protocol

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

Insecure to active eavesdropper

A

Issues with diffie hellman

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

Can modify transmitted messages during key negotiation to attacker-controlled secret key

A

Active eavesdropper in DH

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

Cannot do signatures or authentication

A

Diffie Hellman

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

Can do signatures, asymmetric encryption / decryption, and key exchange

A

RSA

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

Computing x^y mod N

A

Easy problem in RSA

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

Inverting elements. Finding x^-1 such that xx^-1 = 1 mod N

A

Easy problems in RSA

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

Factoring N

A

Hard problems in RSA

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

Given x^y mod N, compute y such that gcd(y, phi(n)) = 1

A

Hard problems in RSA

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

Find two large primes $p$ and $q$

A

RSA key generation step 1

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

Let $n$ = p * q, compute phi(n) = (p - 1)(q - 1)

A

RSA key generation step 2

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

Choose an e that is relatively prime to phi(n) (gcd(e, phi(n)) = 1)

A

RSA key generation step 3

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

Public key = <e, n>

A

RSA key generation step 3

17
Q

Find d = multiplicative inverse of e mod phi(n)

A

RSA key generation step 4

18
Q

Private key = <d, n>

A

RSA key generation step 4

19
Q

c = m^e mod n

A

Encryption in RSA

20
Q

m = c^d mod n

A

Decryption in RSA

21
Q

s = m^d mod n

A

Signing in RSA

22
Q

m = s^e mod n

A

Verification in RSA

23
Q

What keys can be made public

A

Either the private key or public key can be use interchangably, but MUST be consistently used

24
Q
A