1
Q
what’s the Substitution rule?
A
2
Q
7^25 mode 23
A
21
3
Q
what’s Euclid’s rule
A
gcd(x, y) = gcd(x mod y, y)
4
Q
what’s the extension of Euclid’s algorithm
A
5
Q
What’s Fermat’s little theorem?
A
6
Q
What’s Euler’s theorem?
A
7
Q
How to calculate Euler’s function for a composite of two primer numbers?
A
8
Q
When does the inverse of x mode y exist?
A
gcd(x, y) =1
9
Q
What’s Euler function?
A
10
Q
RSA protocol, what sender and receiver should do?
A
CS6515 Algorithms
flashcards
Decks in class (4)
# Cards
