Mathematics, Systems and Robotics Seminar 

06/05/2005, 16:00 — 17:00 — Room P4.35, Mathematics Building
Joachim Erven, Faculdade de Munique

To keep a secret -- no secret with mathematics!

The aim of this talk is to show how simple concepts of number theory can lead to powerful tools of cryptology. First the principles of public key encryption systems are introduced. After that we turn to the needed mathematics – we shortly repeat the congruence arithmetics mod N leading to the problem of discrete logarithms and the theorem of Euler. Based on that the famous algorithms of Diffie-Hellman and Rivest-Shamir-Adleman (RSA) are introduced and their reliability is discussed.