Computer Science – Cryptography and Security
Scientific paper
2006-07-04
Computer Science
Cryptography and Security
Scientific paper
In this paper 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 El-Gamal 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 El-Gamal cryptosystem over finite fields.
No associations
LandOfFree
A simple generalization of El-Gamal cryptosystem to non-abelian groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A simple generalization of El-Gamal cryptosystem to non-abelian groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple generalization of El-Gamal cryptosystem to non-abelian groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-239444