Towards a Uniform Description of Several Group Based Cryptographic Primitives

The public key cryptosystems MST1 and MST2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a uniform description of several proposed cryptographic primitives. In particular, a generalization of MST2 can be regarded as a unifying framework for several suggested cryptosystems including the ElGamal public key system, a public key system based on braid groups and the MOR cryptosystem.

• Type: Conference
• Year: 2004
• Where: DCC
• Authors: Maria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt
• Keywords: Computer Graphics, DCC 2004, Public Key Cryptosystems, Public Key System, Suggested Cryptosystems