January 15, 2002
Practical Aspects of Modern Cryptography
Modular Division
•
Is modular division always well-defined?
•
(1
÷3) mod 6 =
?
•
3
x
mod 6 = 1
has no solution!
•
•
Fact
•
(A
÷B) mod N
always has a solution when
gcd(B,N) = 1
.
