W7 Flashcards

1
Q

Textbook RSA Encryption

A

pk = (N,e)
sk = (N,d)
c = m^e mod N
m = c^d mod N

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

DLOG Problem

A

Given G = <g>
h=g^x
Find x</g>

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

Computational Diffie-Hellman (CDH)

A

Given (G, g, q, g^x, g^y)
Find g^xy
if DLOG hard => CDH hard

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

Decisional Diffie-Hellman (DDH)

A

Given (G, g, q, h^x, h^y, g^xy)
Distinguish between g^xy and u (random)

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

When is DLOG easy?

A

G = (Zq, +)

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

When is DDH easy?

A

G = (Zq*, mult)

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

El Gamal PKE

A

pk = (G, g, q, g^x)
sk = (G, g, q, x)
Enc:
r <- Zq
(g^r, m*h^r)
Dec: c2/(c1^x)

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