2000 character limit reached
Cryptanalysis of some protocols using matrices over group rings (1503.04779v1)
Published 16 Mar 2015 in cs.CR
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.