The MOR cryptosystem and finite p-groups

2013/09/07 by Ayan Mahalanobis, Mahalanobis, Ayan
Computer Science · Mathematics · #20D15 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR #msc:20D15 #msc:94A60

paper · pdf · doi:10.48550/arxiv.1309.1859

arxiv created 2013/09/07 · arxiv updated 2013/09/10

Abstract

The ElGamal cryptosystem is the most widely used public key cryptosystem. It uses the discrete logarithm problem as the cryptographic primitive. The MOR cryptosystem is a similar cryptosystem. It uses the discrete logarithm problem in the automorphism group as the cryptographic primitive. In this paper, we study the MOR cryptosystem for finite p-groups. The study is complete for p^′-automorphisms. For p-automorphisms there are some interesting open problems.

Related

• A note on using finite non-abelian p-groups in the MOR cryptosystem
• A simple generalization of the ElGamal cryptosystem to non-abelian groups II
• The MOR cryptosystem and extra-special p-groups
• Cryptosystems Using Automorphisms of Finitely Generated Free Groups
• A simple generalization of El-Gamal cryptosystem to non-abelian groups