In this lecture we start by explaining a selection of simple
cryptographic algorithms as well as the methods to attack
them. We then try and show how these basic algorithms
evolved over time into the modern ones and give simple
examples of how he recent algorithms work.
As a illustration, we will
to one of the most challenging exercise given at
CSC2010 in the "Writing Secure software" class (that is the
"HTML-riddle problem" ) in order to show how this knowledge
can to solve the problem posed.