Chris Christensen

Professor of Mathematics
Department of Mathematics
Northern Kentucky University
Highland Heights, KY 41099
859-572-6672
FAX: 859-572-6097

E-mail christensen@nku.edu

Here is a copy of the syllabus for CSC/MAT 483 – 001.

Here is a copy of the Departmental syllabus that applies to all MAT and STA courses.

Amber Roger’s vbreaker.

Student-produced materials from previous classes http://www.nku.edu/~cryptography/

CrypTool http://www.crypto-textbook.com/ (go to links and projects)

CryptTools by Don Spickler http://facultyfp.salisbury.edu/despickler/personal/CryptTools.asp

Monday, 9 January

Simple substitution ciphers

Frequencies for English

Wednesday, 11 January

Kerckhoffs' principles

Caesar ciphers

Messages to break

Wednesday, 18 January

Multiplicative ciphers

Messages to break

Monday, 23 January

Affine ciphers

312 affine encryptions of THE

Messages to break

Try cryptohelper.jar on the downloads of http://www.nku.edu/~cryptography/

Wednesday, 25 January and Monday, 30 January

Keyword ciphers

Messages to break

Wednesday, 1 February and Monday, 6 February

Playfair cipher

Frequencies examples

Wednesday, 8 February

Some old, long, and wordy notes about Hill cipher.

A less wordy Introduction to the Hill cipher.

Monday, 13 February

The two Hill cipher known plaintext attacks.

Wednesday, 15 February

Test one

Some Mathematica commands and tables of modular inverses.

Vigenere cipher cryptography

Monday, 20 February

Vigenere cryptanalysis

Friedman's index of coincidence

Another way to find the length of the keyword

Wednesday, 22 February

Running key.

Monday, 27 February

Stream ciphers

One time pads and stream ciphers

Picture of the US-soviet Union hotline

ASCII

Baudot code

http://www.dxzone.com/catalog/Shortwave_Radio/Numbers_stations/

Wednesday, 29 February

Read and understand the material on columnar transposition in transposition ciphers.

For Monday, 12 March create a transposition cipher to exchange. The encryption should use a completely filled rectangle although the message may be padded to fill the rectangle.

M, 12 March

Enigma

W, 14 March

Effects of blocking.

Handbooks of Cryptography

http://www.cacr.math.uwaterloo.ca/hac/ link to Handbook of Applied Cryptography by Menezes, van Oorschot, and Vanstone.

Applied Cryptography by Bruce Schneier.

Simplified DES encryption example.

Simplified DES algorithm from Trappe and Washington.

DES algorithm from Schneier’s Applied Cryptography

Monday, 19 March

Simplified DES decryption example.

Handbooks of Cryptography

http://www.cacr.math.uwaterloo.ca/hac/ link to Handbook of Applied Cryptography by Menezes, van Oorschot, and Vanstone.

Applied Cryptography by Bruce Schneier.

A bit of information about projects.

W, 21 March

PRESENT SPN

Here is a copy of test two.

M, 26 March

Finding multiplicative inverses

Introduction to finite fields, I

W, 28 March

Introduction to finite fields, II

M, 2 April

Simplified AES

AES http://www.moserware.com/2009/09/stick-figure-guide-to-advanced.html

W, 4 April

A long example of simplified AES encryption, finite field calculations, S-box calculations, and key schedule calculations.

http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation

Here is a copy of test three.

Problem 4 turned into electronic dust while inserting a page break. “It has returned:” problem 4.

M, 9 April

KeeLoq http://en.wikipedia.org/wiki/KeeLoq

Here is test three, problem 4.

W, 11 April

Internet timeline

Diffie-Hellman paper

Diffie-Hellman key exchange

M, 16 April

Introduction to public key cryptography

Modular exponentiation

W, 18 April

Introduction to RSA

RSA

The article in Scientific American that introduced RSA.

Communications Electronic Security Group

http://www.cesg.gov.uk/about_us/whoarewe.shtml

The following link contains the papers:

A note on “non-secret encryption” by C. C. Cocks

Non-secret encryption using a finite field by M. J. Williamson

http://www.cesg.gov.uk/publications/historical.shtml

Links to “The History of Non-Secret Encryption by J. H. Ellis

http://cryptocellar.web.cern.ch/cryptocellar/cesg/ellis.pdf

http://jya.com/ellisdoc.htm

http://web.archive.org/web/20030610193721/http://jya.com/ellisdoc.htm

.

RSA factoring challenge http://www.rsa.com/rsalabs/node.asp?id=2092

Mathematica example of RSA encryption.

Mathematica example of breaking RSA.

Mathematica example of key generation.

Here is a copy of the comprehensive exam.

M, 23 April

Cryptographic hash functions

Classification of the SHA3 candidates

SHA3 second round

http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf

W, 25 April

Birthday paradox