A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
New Public Key Cryptosystem Using Finite Non Abelian Groups
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Security Analysis of the MOR Cryptosystem
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
On the security of cryptosystem using automorphism groups
Information Processing Letters
Probabilistic algorithms in finite fields
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
The MOR cryptosystem was introduced in 2001 as a new public key cryptosystem based on non-abelian groups. This paper demonstrates that the complexity of breaking MOR based on groups of the form $GL(n,q)\times_\theta \mathcal{H}$ ($\mathcal{H}$ a finite abelian group) is (with respect to polynomial reduction) not higher than the complexity of the discrete logarithm problem in small extension fields of . Additionally we consider the construction of a generic attack on MOR.