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.
CITATION STYLE
Eftekhari, M. (2017). Cryptanalysis of some protocols using matrices over group rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10239 LNCS, pp. 223–229). Springer Verlag. https://doi.org/10.1007/978-3-319-57339-7_13
Mendeley helps you to discover research relevant for your work.