A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups

Ayan Mahalanobis · Communications in Algebra · 2008

In this article we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the ElGamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equivalent to the ElGamal cryptosystem over finite fields.

Read the paper · More papers on PaperTik