Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings (Q2033526)

The paper presents a nice and easy to follow improved cryptanalysis of an ElGamal-like cryptosystem based on matrices over group rings. The authors proved by a simple but interesting linear-algebraic argument that the cryptosystem proposed by \textit{S. Inam} and \textit{R. Ali} [``A new ElGamal-like cryptosystem based on matrices over group ring'', Neural Comput. Appl. 29, No. 11, 1279--1283 (2018; \url{doi:10.1007/s00521-016-2745-2})] does not archive IND-CPA and IND-CCA security. Furthermore, they have developed a polynomial-time algorithm to compute, based on linear algebra, all equivalent keys for a given public key pair.