Computer Science – Cryptography and Security
Scientific paper
2007-02-16
Computer Science
Cryptography and Security
Scientific paper
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.
No associations
LandOfFree
A note on using finite non-abelian $p$-groups in the MOR cryptosystem 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 note on using finite non-abelian $p$-groups in the MOR cryptosystem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on using finite non-abelian $p$-groups in the MOR cryptosystem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-196318