Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Or, M.: Probabilistic algorithms in finite fields. IEEE Symposium on Foundations of Computer Science 22, 394–398 (1981)
Dieudonné, J.: On the automorphisms of classical groups. Memoirs of the American Mathematical Society 2 (1951)
ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196. pp. 10–18. Springer, Heidelberg (1985)
Korsten, A.: The Discrete Logarithm Problem in Semidirect Products and the Reduction of the MOR Cryptosystem, Diplomarbeit, University of Tübingen, Germany (2005)
Lee, I.S., Kim, W.H., Kwon, D., Nahm, S., Kwak, N.S., Baek, Y.J.: On the security of MOR public key cryptosystem. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329. pp. 387–400. Springer, Heidelberg (2004)
Menezes, A.J., Wu, Y.: The discrete logarithm problem in GL(n,p). Ars Combinatoria 47, 23–32 (1998)
Paeng, S.H., Ha, K.C., Kim, J.H., Chee, S., Park, C.: New public key cryptosystem using finite non abelian groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139. pp. 470–485. Springer, Heidelberg (2001)
Paeng, S.H., Kwon, D., Ha, K.C., Kim, J.H.: Improved public key cryptosystem using finite non abelian groups, Cryptology ePrint Archive (2001), http://eprint.iacr.org/2001/066
Paeng, S.H.: On the security of cryptosystem using automorphism groups. Information Processing Letters 88, 293–298 (2003)
Taylor, D.: Pairs of generators for matrix groups, I. The Cayley Bulletin 3, 76–85 (1987)
Tobias, C.: Security analysis of the MOR cryptosystem. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567. pp. 175–186. Springer, Heidelberg (2002)
Tobias, C.: Security analysis of MOR using
. WOSIS 2, 170–179 (2004)Tobias, C.: Design und Analyse kryptographischer Bausteine auf nicht-abelschen Gruppen, PhD thesis, University of Giessen (2004)
. WOSIS 2, 170–179 (2004)Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korsten, A. (2008). Cryptanalysis of MOR and Discrete Logarithms in Inner Automorphism Groups. In: Lucks, S., Sadeghi, AR., Wolf, C. (eds) Research in Cryptology. WEWoRC 2007. Lecture Notes in Computer Science, vol 4945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88353-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-88353-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88352-4
Online ISBN: 978-3-540-88353-1
eBook Packages: Computer ScienceComputer Science (R0)