Cryptanalysis of some protocols using matrices over group rings

2015/03/16 by Mohammad Eftekhari, Eftekhari, Mohammad
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.1503.04779

arxiv created 2015/03/16 · arxiv updated 2015/03/17

Abstract

We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.

Related

• Constructions in public-key cryptography over matrix groups
• Cryptanalysis of Semidirect Product Key Exchange Using Matrices Over\n Non-Commutative Rings
• Problems in group theory motivated by cryptography
• A CCA secure cryptosystem using matrices over group rings
• The ElGamal cryptosystem over circulant matrices