Next:
Introduction to Cryptography
Up:
Using Maple
Previous:
A nod toward statistics
fsqFsHn sGGousG
Introduction to Cryptography
Simple Ciphers
Simple substitution
The Caesar cipher, and the ASCII encoding
Treating characters as numbers
Render unto Caesar
Defining functions with
proc
; Local and global variables
Caesar cipher redux
Improved Caesar-like ciphers
The Vignère cipher
One-time pads
Multi-character alphabets
Reading and Writing from a file
Affine enciphering
When do affine encodings fail?
Implementing and using an affine encoding
Breaking an affine cipher
Enciphering matrices
Treating text as vectors
Affine encoding with matrices
A Known-plaintext attack on an affine matrix cipher
Modern cryptography
Secure cryptosystems
Message digests
Public Key cryptography
Some Number Theory
The greatest common divisor and the Euclidean algorithm
The Chinese Remainder Theorem
Powers modulo n
The Euler
-function and Euler's Theorem
The RSA Public key cryptosystem
Implementing RSA in Maple
Useful preliminaries
Basic Setup: choice of primes, base, exponent, and decoding exponent
Encoding and Decoding
Translated from LaTeX by Scott Sutherland
1999-12-08
-function and Euler's Theorem