1
Q
Recall the definition of two integers being congruent modulo n for a natural number n
A
2
Q
Determine whether [two integers a and b] are congruent modulo [a given natural number n]
A
3
Q
Recall the definition of a residue class modulo n
A
4
Q
Perform modular reduction modulo n
A
5
Q
Perform [various modular arithmetic operations] in Z n including addition, subtraction and multiplication (mod n)
A
6
Q
Determine which elements of Z n have multiplicative inverses, and find these multiplicative inverses when they exist [for a particular natural number n]
A
7
Q
Use the Square-and-Multiply Algorithm to perform modular exponentiation
A
Number Theory & Cryptography
flashcards
Decks in class (19)
# Cards
