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

The deadline for applications for TA positions at IMADA for the spring is
November 21.

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.