5) The group of units modulo n Flashcards

1
Q

What does it mean for two integers a and b to be congruent modulo n

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

What is Zn

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

What algebraic structure does Zn form under addition

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

What is a unit in Zn, and how is the set of units denoted

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

When is an element [a]∈Zn a unit

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

What is the set of units Up in Zp, where p is prime

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

What algebraic structure does the set of units Un form under multiplication modulo n

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

What is Wilson’s Theorem

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

What is Euler’s φ-function

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

What are the key properties of Euler’s φ-function

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

What is the sum of Euler’s φ-function over all positive divisors of n

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

What is Euler’s Theorem

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

What is Fermat’s Little Theorem

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

What can you infer from Fermat’s Little Theorem about a^p and a^p−2modulo p

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

What is a Carmichael number

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

How is Euler’s theorem used in the RSA cryptosystem for encryption and decryption