CRMar 16, 2015
Cryptanalysis of some protocols using matrices over group rings
arXiv:1503.04779v115 citations
AI Analysis
This work exposes vulnerabilities in specific cryptographic protocols, which is important for cryptographers and security practitioners, though it appears incremental as it targets existing protocols.
The authors tackled the cryptanalysis of two cryptographic protocols based on the discrete logarithm problem in matrix groups over group rings, successfully breaking them by finding the secret key.
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.