Next:
Contents
Cryptology Class Notes
David J. Wright
Contents
Introduction to Cryptology
Computational aids
Netscape
MAPLE
Supplementary program files
Prime Numbers
Euclid's Algorithm
Integer Division
Example
Formula
Modular Arithmetic
Counting and choosing things
Probability and statistics
Basic rules of probability: independence and exclusion
Conditional probability and perfect security
Powers in Modular Arithmetic
Relatively prime numbers
The smallest power congruent to 1: Fermat's theorem
Square roots
Solving Congruences: The Chinese Remainder Theorem
Challenges!
Eggs in the Basket
Five Pirates and a Monkey
Outside work
Extra Readings
Problems
Bibliography
About this document ...
David J. Wright
2000-09-11
