Assignment 2 is due on November 21.
A correct proof of correctness for Shank's Algorithm is on Lecture Note 12.
The funcitons parity and half that I defined in lecture on October 5 are the same as functions B
in section 11.8.2 of the textbook.
The deadline for applications for TA positions at IMADA for the spring is November 21.
Cryptography Made Simple
, by Nigel P. Smart, Springer, 2016. There will also be notes, including the old Discrete Math
(the most relevant part is the algebra).
There is an
for the textbook, maintained by the author.
Topics for 2013.
Topics for 2016.
Reading list for exam
2016: On this
, the chapters in the textbook covered are in approximately the order we covered them in class.
is due at 12:00 on October 11.
is due at 23:59 on November 21.
regarding factoring. Note that a 768-bit RSA key was factored in 2009.
on computational number theory.
The slides related to RSA come from
related to discrete logarithms.
from on NIST's homepage.
Last modified: Mon Dec 19 08:09:18 CET 2016 -
Data protection at SDU
Databeskyttelse på SDU