HONR 1000.901: Introduction to Cryptology
MWF 1:30-2:20 in CLB 214

Instructor

David Wright, MS 527, 744-5688,
email: wrightd at math dot okstate dot edu
web: http://klein.math.okstate.edu/~wrightd/crypt

Office hours

MWF 10:30-11:30 AM at MS 527, M 2:30-3:30 PM, and also by appointment. I will always be in my office for help during these scheduled office hours. You can always call on the phone or knock on the door at any other time. I would be very happy if you drop by for help or any other reason.

Text

A. Beutelspacher, Cryptology: an introduction to the art and science of enciphering, encrypting, concealing, hiding and safeguarding, described without any arcane skullduggery but not without cunning waggery for the delectation and instruction of the general public

Course description

Cryptology comprises cryptography, or the science of devising secure methods of communication (``codes''), and cryptanalysis, the science of ``breaking'' secret codes, that is, learning how to understand the coded messages without being privy to the method of encoding them. This course is an introduction to the basics of the subject, as well as the modern implications and applications. We will stay fairly close to the topics covered in the textbook. Here is a summary of topics:

Chapter 1

Basic terminology: symmetric cipher systems (or cryptosystems), additive ciphers, monoalphabetic ciphers, basic use of statistical analysis in cryptanalysis.

Chapter 2

Polyalphabetic ciphers, Vigenère cipher: cryptanalysis by methods of Kasiski and Friedman.

Chapter 3

Abstract theory of cryptology (after Shannon), perfect security, the one-time pad, pseudo-random sequences (shift registers).

Chapter 4

Authentication, MAC (message authentication code), one-way functions, zero-knowledge protocols, electronic shopping.

Chapter 5

Public-key cryptography, asymmetric cryptosystems, solutions to the problems of key distribution and digital signatures, the RSA and discrete logarithm systems, modular arithmetic.

Chapter 6

Anonymity, electronic cash, MIX's.

In addition, we will add material on the history of cryptology and decipherment in general, using sources to be made available as we proceed.

Prerequisites

Comfort with notation such as f(x) for a function and zy+x+1 for an algebraic combination of numbers x, y and z. Some knowledge of prime numbers and factorization might be helpful. Hopefully, I will provide most everything else.

Course Requirements

Homework

Assigned and collected every week or two.

Exams

Friday, Sept. 21 and Friday, Nov. 2.

Final Paper

From a list of topics to be distributed. Could involve programming if that is to your taste. Idea and brief outline of paper due Nov. 5; longer sketch or rough draft due Nov. 28; final draft due Friday, Dec. 7. Oral presentations given in week of Dec. 3 to Dec. 7.

Grading

HW: 25%, Exam 1: 25%, Exam 2: 25%, Paper: 25%. Guaranteed grades of A, B, C, D are awarded to scores at least 90%, 80%, 70%, and 60%, respectively. However, these grade boundaries may be lowered based on the instructor's judgment.

Attendance

Is mandatory, but I will not be taking roll every class or be too concerned unless absences are frequent. Students should let me know if they have valid reasons for missing classes, especially in advance of exams. Homework should be turned in prior to the due date if students will be unable to attend class on the due date.