The task that you have to perform in order to be able to take the exam is described along with the exam topics for 2019 on this homepage.
A correct proof of correctness for Shank's Algorithm is on Lecture Note 12.
The functions 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.
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.
Topics for 2019.
Reading list for exam
2016: On this
, the chapters in the textbook covered are in approximately the order we covered them in class.
2019: On this
, the chapters in the textbook covered are in approximately the order we covered them in class. The other required readings are also listed.
is due at 12:00 on October 11.
is due at 23:59 on November 21.
is due at 13:00 on December 19.
regarding factoring. Note that a 768-bit RSA key was factored in 2009.
on computational number theory.
The slides related to RSA come from
The slides related to protocols 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