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_{1} and B_{h} in section 11.8.2 of the textbook.

The textbook:

Cryptography Made Simple, by Nigel P. Smart, Springer, 2016.
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 textbook, maintained by the
author.

2016: On this list,
the chapters in the textbook covered are in approximately
the order we covered them in class.

2019: On this list,
the chapters in the textbook covered are in approximately
the order we covered them in class. The other required readings are also listed.