Week 3 Flashcards

1
Q

What is Public Key Encryption?

A

Two keys - one for encryption (public), one for decryption (private).

Can derive public from private, but not the other way around.

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

Explain m^-1 mod n?

A

Multiplicative inverse mod n.

Denotes number m’ such that m * m’ = 1 mod n.

m^-1 exists if m and n share no common factors.

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

How does Diffie-Hellman work?

A

Uses two public parameters: generator g (often 160 bits long) and prime p (often 1024 bits long).

Two random numbers picked and find:

tA = g^rA mod p, tB = g^rB mod p

Exchange these numbers and key = g^rArB = tB^rA = tA^rB mod p

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

What are the benefits and drawbacks of Diffie-Hellman?

A

Benefit: Cannot work out rA and rB from tA and tB.

          No keys shared at the start.

Drawback: Additional authentication required.

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

What is Elgamal?

A

Diffie-Hellman as a public key scheme, with fixed g and p.

rA picked as private key, tA = g^rA mod p as public key.

Message encrypted by choosing rB and sending (g^rB mod p, M * tA^rB mod p).

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

What is RSA?

A

Public key system, which carefully generates e, d and n.

n is the product of two large primes, have (m^e)^d = m mod n for every m.

Public key is (e,n) and private key is (d,n).

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

How does encryption and decryption work in RSA?

A

Encrypt m: c = m^e mod n

Decrypt c: m = c^d mod n

Security depends on difficulty of finding prime factors of n.

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

How does Public Key Crypto work?

A

Ekp(KS), {M}ks

Make new symmetric key.
Encrypt that with the public key.
Encrypt message with the symmetric key.

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

Explain signatures?

A

Using RSA: Epub(Dpriv(M)) = M

Sign message with private key, can be verified with public key.

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

What is a hash?

A

Short string generated from a message.

Any small change makes hash different.

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

What are hashes used for?

A

Verification of message download.

Tying parts of a message together.

Signatures.

Protect passwords.

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

What is a Preimage attack?

A

Find a message with a given hash - very hard.

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

What is a Collision attack?

A

Finding two messages with the same hash.

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

What is a Prefix Collision attack?

A

Attacker picks a message prefix?

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

Name an attack on MAC?

A

Add data without knowing key.

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

How does CCM mode work?

A

Calculate AES CBC-MAC on the data.

Encrypt the message followed by the MAC using same key and CTR mode.

17
Q

What is the purpose of hashes?

A

To give reasonable assurance (many-to-one) of quality between two strings.

18
Q

Explain Timestamps in Signatures?

A

Included to prevent reuse of signature and document.

19
Q

What attack are Public-Key Algorithms susceptible to?

A

Chosen-Ciphertext attack.

With access to decryption of chosen messages with the private key, deduce the key/algorithm.