


















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 $p$-groups. The study is complete for $p^\prime$-automorphisms. For $p$-automorphisms there are some interesting open problems.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。