Professor of Mathematics
Department of Mathematics
Northern
Highland Heights
859-572-6672
FAX: 859-572-6097
E-mail christensen@nku.edu
Here is a copy of the syllabus for CSC/MAT 584 - 001.
Here is a copy of the Departmental syllabus that applies to all MAT and STA courses.
One time pads and stream
ciphers
http://home.freeuk.com/spook007/
Taft Lecture at UC, Friday, 28 January, GPU cards in cryptography
Thursday, 27 January
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
Finding multiplicative inverses
Here is a copy of test number one. It is due on Tuesday, March 1.
Thursday, 17 February
Introduction to finite fields, I
Introduction to finite fields, II
Thursday, 24 February
A long example of simplified AES encryption, finite field calculations, S-box calculations, and key schedule calculations.
Tuesday, 1 March
Chapter 5 Modes of operation of block ciphers
http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation
Classification of the SHA3 candidates
Thursday, 3 March
SHA3 second round
http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf
Tuesday, 15 March
Read chapter 6
Introduction to public key cryptography
Thursday, March 17
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://web.archive.org/web/20030610193721/http://jya.com/ellisdoc.htm
Here is a copy of test two. The test is due on Thursday, March 31.
RSA factoring challenge http://www.rsa.com/rsalabs/node.asp?id=2092
Tuesday, 22 March
Mathematica example of RSA encryption.
Mathematica example of breaking RSA.
Thursday, 24 March
Mathematica example of key generation.
Mathematica example of find p and q knowing n and phi of n
Change: Test two due on Thursday, 7 April.
Link n to The Prime Pages http://primes.utm.edu/
Link to GIMPS http://www.mersenne.org/
Tuesday, 29 March
Thursday, 31 March
Tuesday, 5 April
Shanks’ Baby-Step Giant-Step Algorithm pp. 221 and 222.
Shanks' baby-step Giant Step example
Here is a Word file of Test three. It is due on Thursday, April 21.
Thursday, 7 April and
Tuesday, 12 April
Certicom ECC Tutorial http://www.certicom.com/index.php/10-introduction
About elliptic curves.
Thursday, 14 April
Tuesday, 19 April
Classification of the SHA3 candidates
SHA3 second round
http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf
Thursday, 21 April
DSA pp. 277 – 282.
Here is a Word file of the final exam. The exam is due on Thursday, May 5.
Tuesday, 26 April
Alternative exam problem. A DSA problem.
Thursday, 28 April
“A 75-minute summary of the course.”
