Modul:   MAT076  Arbeitsgemeinschaft in Codierungstheorie und Kryptographie

The MOR cryptosystem

Talk by Dr. Ayan Mahalanobis

Speaker invited by: Prof. Dr. Joachim Rosenthal

Date: 11.03.09  Time: 11.15 - 13.00  Room: Y27H46

The MOR cryptosystem is an elementary and straightforward generalization of the ElGamal cryptosystem. In this case, the discrete logarithm problem works in the automorphism group of a group G, rather than G itself. This allows us to use almost any group for the MOR cryptosystem.

In this talk we will see the definition of this cryptosystem and one instance of a secure MOR cryptosystem.