Asymmetric Cryptography Flashcards
Distributing secret keys is hard and expensive
Key distribution issues
Find y such that b^y mod p = x given x
Discrete log problem
$p$, $g < p$ group generator
public parameters of DH
- Pick a from [0, p-1)
- Pick b from [0, p-1)
- A -> B: g^a mod p
- B -> A: g^b mod p
- k = g^ab mod p
Diffie Hellman protocol
Insecure to active eavesdropper
Issues with diffie hellman
Can modify transmitted messages during key negotiation to attacker-controlled secret key
Active eavesdropper in DH
Cannot do signatures or authentication
Diffie Hellman
Can do signatures, asymmetric encryption / decryption, and key exchange
RSA
Computing x^y mod N
Easy problem in RSA
Inverting elements. Finding x^-1 such that xx^-1 = 1 mod N
Easy problems in RSA
Factoring N
Hard problems in RSA
Given x^y mod N, compute y such that gcd(y, phi(n)) = 1
Hard problems in RSA
Find two large primes $p$ and $q$
RSA key generation step 1
Let $n$ = p * q, compute phi(n) = (p - 1)(q - 1)
RSA key generation step 2
Choose an e that is relatively prime to phi(n) (gcd(e, phi(n)) = 1)
RSA key generation step 3