Home Cryptanalysis of a system using matrices over group rings
Article
Licensed
Unlicensed Requires Authentication

Cryptanalysis of a system using matrices over group rings

  • Chris Monico EMAIL logo and Mara D. Neusel
Published/Copyright: September 24, 2015
Become an author with De Gruyter Brill

Abstract

In several recent works of D. Kahrobaei, C. Koupparis, and V. Shpilrain, public-key protocols have been proposed which depend on the difficulty of computing discrete logarithms in matrix rings over group rings. In particular, the specific ring of 3×3 matrices over 𝔽7S5 has been proposed for use in some of these protocols. In this paper, we show that the discrete logarithm problem in this matrix ring can be solved on a modern PC in seconds, and we give a solution to the challenge problem over 𝔽2S5 proposed in one of the aforementioned works.

MSC: 94A60; 11T71

We are grateful to the anonymous referee and editors for valuable feedback and suggestions on earlier drafts of this paper.

Received: 2014-4-17
Published Online: 2015-9-24
Published in Print: 2015-11-1

Ā© 2015 by De Gruyter

Downloaded on 15.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/gcc-2015-0008/html
Scroll to top button