Wed | 4/28 | RSA Encoding |
Next time: our poster session will be Wednesday, May 5th, from 1-3 (that's the closest I could find to our class in the exam schedule). Come prepared to show off your stuff! I'll probably have everyone go around the room, and say a little about their poster. Then we'll turn folks loose in waves (so a third, say, of the posters will be available for review with their presenters at any one time).
|
Fermat's little theorem:
If p is a prime number and n is any integer that does not have p as a factor, then np-1 is equal to 1 mod p.
In other words, np-1 will always have a remainder of 1 when divided by p.
What is 232639 mod 13?
(Use Fermat's little theorem!)