Contents

• 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!
• Outside work
  • Extra Readings
  • Problems
• Bibliography