A note on using finite non-abelian p-groups in the MOR cryptosystem

2007/02/16 by Ayan Mahalanobis, Mahalanobis, Ayan
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR

paper · pdf · doi:10.48550/arxiv.cs/0702095

arxiv created 2007/02/16 · arxiv updated 2009/12/01

Abstract

The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It seems reasonable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.

Related

• A simple generalization of El-Gamal cryptosystem to non-abelian groups
• A simple generalization of the ElGamal cryptosystem to non-abelian groups II
• The MOR cryptosystem and finite p-groups
• The MOR cryptosystem and extra-special p-groups
• MOR Cryptosystem and classical Chevalley groups in odd characteristic