Cryptanalysis of some protocols using matrices over group rings
Cryptography and Security
2015-03-17 v1
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.
Cite
@article{arxiv.1503.04779,
title = {Cryptanalysis of some protocols using matrices over group rings},
author = {Mohammad Eftekhari},
journal= {arXiv preprint arXiv:1503.04779},
year = {2015}
}