El Gamal Encryption Flashcards
1
Q
How does El Gamal Encryption generate public keys?
A
By finding the
primitive roots modulo n
of a prime number
2
Q
Given that b!=0 ,
what is the gcd( a, b )
A
gcd( a , b )
==
gcd( b, a mod b )
3
Q
Given that b==0 ,
what is the gcd( a , b )
A
gcd( a , b )
==
a
4
Q
What is
(a + b) mod n
equivalent to?
A
(a + b) mod n
===
(a mod n + b mod n) mod n
5
Q
What is
ab mod n
equivalent to?
A
ab mod n
===
(a mod n) (b mod n) mod n
6
Q
Do multiplicative inverses always exist for modular arithmetic?
A
No
7
Q
Will x always have a multiplicative inverse in mod P,
if P is a prime number?
A
Yes
