A course description.
Cryptography: Theory and Practice, Third Edition, by Stinson. There will also be notes, including the old Discrete Math
(the most relevant part is the algebra).
There is an
for the third edition of the textbook, maintained by the author.
which I used in some lectures (reused from DM11).
Topics for 2013.
Reading list for exam
Reading list for 2013.
. This contains the first assignment.
. This contains the second assignment.
. This contains the third assignment.
. This contains the fourth assignment.
regarding factoring. Note that a 768-bit RSA key was factored in 2009.
Some notes on computational number theory
A note on Pollard's factoring algorithm
. This also contains a description of the birthday paradox.
Slides from lectures on RSA.
on the Web.
large integer packages
Information about the new hash function standard (
Archived information from NIST about the Advanced Encryption Standard (
). 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
from lectures on quantum cryptography and computing.
Evaluation of course
Last modified: Thu Jul 25 12:25:32 CEST 2013 -