The 7th Central European Conference on Cryptology
June 22-24, 2007, Smolenice, Slovakia

Abstract of a plenary talk

Public Key Cryptography Based on Covers of Finite Groups

Trung van Tran

Institute for Experimental Mathematics
Universitšt Duisburg-Essen
Ellernstrasse 29, 45326 Essen

Logarithmic signatures for finite permutation groups were first used by S. Magliveras in the 80ís to build the symmetric key cryptosystem PGM. Recently the concept of covers for finite groups has been introduced, which can be viewed as a generalization of that of logarithmic signatures. It turns out that covers for finite groups are very useful objects that allows us to construct public key primitives. The talk gives an overview of the current new approaches in this direction.

Last updated on February 12, 2007.