Intro Flashcards

1
Q

Definition of perfect security, shannon theorem and (t-epsilon) security

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

Definition of computational security

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

Definition of negligible function

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

Definition of complexity

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

Definition of polynomial time algo

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

Cobham-Edmond thesis and extended thesis

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

Definition of probabilistic algorithm

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

Definition of probabilistic polynomial time algorithm

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

Expected PPT algorithm

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

Definition of group

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

Definition of subgroup

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

Definition of cyclic group

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

Order of a group

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

Lagrange Theorem about the order of a group

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

Definition of ring

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

Definition of field

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

Homomorphism fort a group and for a field

A
18
Q

Equality mod n

A
19
Q

Ring of integers mod n

A
20
Q

Invertible number

A
21
Q

Multiplicative group of integers mod n

A
22
Q

Euler’s Theorem

A
23
Q

CRT

A
24
Q

Definition of finite field

A
25
Q

Factoring assumption: definition, generation, experiment

A
26
Q

RSA assumption: definition, generation, experiment

A
27
Q

Relation between RSA and Factoring assumption, proof

A
28
Q

DL assumption: definition, generation, experiment

A
29
Q

Lemma: DL random self reduction and proof

A
30
Q

DH assumption: definition, generation, experiment

A
31
Q

Implications of DH assumption and proof

A
32
Q

Definition of quadratic residue

A
33
Q

Definition of Legendre symbol

A
34
Q

Euler’s criterion

A
35
Q

Jacobi symbol

A
36
Q

What’s the difference relative to QR if p is prime or not?

A
37
Q

Quadratic Residuosity Problem, assumption and experiment

A
38
Q

Implications between QR assumption and DCR assumption

A
39
Q

Decisional Composite Residuosity Assumption

A
40
Q

Perfect, statistical and computational indistinguishability, relationship and proofs

A
41
Q

Assumptions with respect to indistinguishability

A