Cryptanalysis of a Matrix-based MOR System

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We cryptanalyze a recently proposed matrix-based MOR cryptosystem. The security of the system depends on the difficulty of solving the following discrete logarithm problem: given an inner automorphism φ of SL(d, 𝔽 q) and φ a (each given in terms of their images on generators of SL(d, 𝔽 q)), find a. We show that this problem can be reduced to a small number of similar problems in quotients of polynomial rings and solved in subexponential-time.

Original languageEnglish
Pages (from-to)218-227
Number of pages10
JournalCommunications in Algebra
Issue number1
StatePublished - Jan 2 2016


  • Discrete logarithm problem
  • MOR cryptosystem
  • Special linear groups


Dive into the research topics of 'Cryptanalysis of a Matrix-based MOR System'. Together they form a unique fingerprint.

Cite this