MCS 150

Cryptanalysis

January Term 2001

This is a course in making and breaking codes. Students will be engaged in learning how to ``crack'' enciphered messages without knowing, at the outset, the enciphering keys. Beginning with cryptograms of the sort found in newspapers and puzzle books, we shall work our way through successively more complicated enciphering schemes and learn methods of attack based on exhaustive search, computer programs, statistics, and mathematics. This course will also survey the history of cryptography and modern developments, including public-key cryptography and data encryption techniques.

Instructors

John Holte

Office: Olin 307
Telephone: x7465
E-mail: holte@gustavus.edu
Homepage: http://www.gac.edu/~holte

Moira McDermott

Office: Olin 313
Telephone: x7478
E-mail: mmcdermo@gustavus.edu
Homepage: http://www.gac.edu/~mmcdermo

Textbooks

Both texts are required.

Elementary Cryptanalysis: A Mathematical Approach by Abraham Sinkov, Mathematical Association of America, c1966
Cryptology by Albrecht Beutelspacher, Mathematical Association of America, c 1994

Class meetings

9:00-10:00 & 10:30-12:00 MTWRF
Olin 320
Faithful attendance and participation is required.

Work outside class

January Term is ideally suited for learning by immersion in a single course, and you will learn Cryptanalysis best through the experience of concentrating at length on the problems and theory of "code breaking." It is recommended that you spend your afternoons in Olin, where you will be able to work with your team on solving ciphers, to consult with the profs, and to make use of MAPLE and other computer resources.
Official Gustavus January Term policy: "Student workload, including class time, outside reading, and other course-related work, will not be less than 40 hours per week."

Course content

Cryptography	Math/stats/computing	Cryptanalysis
Shift ciphers Decimation Affine ciphers	Modular arithmetic Histograms	Solving affine ciphers Brute force solutions
Monoalphabetic substitution: Aristocrats & Patristocrats	Frequency distributions Combinatorics	Using frequency data Probable word method Pattern words
Polyalphabetic substitution Vigenere cipher	Index of coincidence Prime factorization Periods of sequences	Use of I.C. and Kasiski analysis Reduction to a monoalphabet
Polygraphic systems Playfair cipher Hill's system	Matrix operations Digraph frequencies	Solving Hill ciphers by algebra
Transposition ciphers	Permutations Division algorithm	Paper and scissors methods
Public key encryption	Fermat's Little Theorem Chinese Remainder Theorem	Factorization attacks

Grading

in writing

Your grade will be based on the following assuming satisfactory attendance and participation in class.

Team solutions of cryptograms (best 5 of 6) 40%

Individual problem solutions 19%

Tests (3 @7%) 21%

Report/project 20%

Total 100%

Extra credit TBA

Team solutions of cryptograms (best 5 of 6)	40%
Individual problem solutions	19%
Tests (3 @7%)	21%
Report/project	20%
Total	100%
Extra credit	TBA