Cryptanalysis of a system using matrices over group rings

Chris Monico, Mara D. Neusel

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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 F7S5 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 F7S5 proposed in one of the aforementioned works.

Original languageEnglish
Pages (from-to)175-182
Number of pages8
JournalGroups, Complexity, Cryptology
Issue number2
StatePublished - Nov 1 2015


  • Diffie-Hellman
  • Group ring
  • representation theory


Dive into the research topics of 'Cryptanalysis of a system using matrices over group rings'. Together they form a unique fingerprint.

Cite this