Cryptography
Quoting Wikipedia:
Cryptography or cryptology is the practice and study of techniques for secure communication in the presence of third parties called adversaries. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages; various aspects in information security such as data confidentiality, data integrity, authentication, and non-repudiation are central to modern cryptography. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, and electrical engineering. Applications of cryptography include ATM cards, computer passwords, and electronic commerce.
In 2006, I was given the opportunity (through an EGIDE funded mission), to give a serie of lectures (in french) in the context of the “Cours Sécurité DEA Informatique” of the Univ. of Yaounde I (Cameroon). I also participated to several practical sessions on this topic within the Master in Security, Cryptology and Coding of Information systems, a joint program between Université Joseph Fourier (UJF) (now Université Grenoble-Alpes) and Grenoble INP between 2004 and 2007.
This page offers the material I prepared for this lecture.
Any comment to make it up-to-date is welcome -- see Contact.
Lectures
Title | Size | Language |
---|---|---|
Introduction à la cryptographie | 2MB | ![]() |
Introduction à la cryptographie à clé publique, by: F. Leprévost, S. Varrette and N. Bernard | 882 KB | ![]() |
Fonctions de Hachage et Signatures Electroniques | 815K | ![]() |
Architectures PKI | 346K | ![]() |
Note: I have also some support slides on elliptic curves cryptography but haven’t collected the authorization to display them online. If you need them, mail me so I can put you in contact with the primary authors of these slides.
Support Books
Several reference books can be used as support for this lecture: [1] [2] [3].
Otherwise, I strongly encourage you to check my own books related to this topic:
Exercises / Projects
Important: I feel obliged to insist: the below material (including appendix layout) are quite old now and would deserve a big refresh.
They are proposed for archiving reasons in the hope they might still be useful to students / lecturers.
You will find way more up-to-date exercises in my book.
Through the UJF/INPG Master SCCI, I prepared in collaboration with Prof. Gérard Vinel several exercises over MAPLE proposed below:
Title | Size | Language |
---|---|---|
TP MAPLE: Théorie des Nombres | 78KB | ![]() |
TP MAPLE: Tests de primalité probabilistes | 76KB | ![]() |
Past Exams
Below are (old) exams I prepared for lectures related to cryptography (and network security).
Year | Level | Institute | Download |
---|---|---|---|
2004-2005 | CUT3/L3 | UL CUT3 | Examen: Cryptographie |
2005-2006 | DEA I1/M1 | Univ. of Yaounde | Examen 1: Cryptographie & Securité Réseau |
2005-2006 | DEA I1/M1 | Univ. of Yaounde | Examen 2: Cryptographie & Securité Réseau |
References
- D. R. Stinson, Cryptography: Theory and Practice, 2nd ed. Chapman & Hall/CRC Press, 2002.
- B. Schneier, "Cryptographie Appliquée", 2nd ed. NY: Vuibert, Wiley and International Thomson Publishing, 1997.
- A. J. Menezes, S. A. Vanstone, and P. C. V. Oorschot, Handbook of Applied Cryptography, 1st ed. CRC Press, Inc., 1996.