The MOR cryptosystem and finite $p$-groups
Group Theory
2013-09-10 v1 Cryptography and Security
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 -groups. The study is complete for -automorphisms. For -automorphisms there are some interesting open problems.
Cite
@article{arxiv.1309.1859,
title = {The MOR cryptosystem and finite $p$-groups},
author = {Ayan Mahalanobis},
journal= {arXiv preprint arXiv:1309.1859},
year = {2013}
}