# Cryptology

None.

## Description

A course description.

## The textbook:

Cryptography: Theory and Practice, Third Edition, by Stinson. There will also be notes, including the old Discrete Math notes (the most relevant part is the algebra).
There is an errata list for the third edition of the textbook, maintained by the author.
There are slides which I used in some lectures (reused from DM11).

June 1995.dvi
June 1996.dvi
June 1998.dvi
January 1999.ps
June 2000.ps
June 2001.ps
June 2003.pdf
June 2005.pdf
January 2007.pdf
June 2008.pdf
June 2011.pdf

Topics for 2013.

## Weekly notes:

week1.pdf.
week2.pdf.
week3.pdf. This contains the first assignment.
week4.pdf.
week5.pdf. This contains the second assignment.
week6.pdf.
week7.pdf. This contains the third assignment.
week8.pdf.
week9.pdf.
week10.pdf.
week11.pdf. This contains the fourth assignment.
week12.pdf.
week13.pdf.
week14.pdf.

## Problems:

Three cryptograms.

## Miscellaneous:

Bruce Schneier's old predictions regarding factoring. Note that a 768-bit RSA key was factored in 2009.
Some notes on computational number theory (notes.dvi) (also in PDF).
A note on Pollard's factoring algorithm (Pollard.dvi). This also contains a description of the birthday paradox.
Slides from lectures on RSA. (RSA notes.pdf).
Cryptology pages on the Web.
Information about the new hash function standard (Keccak).
Archived information from NIST about the Advanced Encryption Standard (Rijndael). Click on "Rijndael (AES Algorithm) Information" and then on "Rijndael Specification".
Ivan Damgård's and Jesper Buus Nielsen's notes on Commiment Schemes and Zero-Knolwedge Protocols (2011).
Ivan Damgård's notes on Graph Non-Isomorphism and Zero-Knowledge for NP.
R. de Wolf's survey on Quantum computation and Shor's factoring algorithm.
Slides from lectures on quantum cryptography and computing.
Evaluation of course and response.

 IMADA HOME | SDU HOME | Previous page | Last modified: Thu Jul 25 12:25:32 CEST 2013 - Joan Boyar