Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings
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.
- Cryptosystems in automorphism groups of group rings of Abelian groups.
- Cryptanalysis of the CLR-cryptosystem
- Cryptanalysis of some protocols using matrices over group rings
- Cryptanalysis of a system using matrices over group rings
- A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
- A linear algebra attack to group-ring-based key exchange protocols
- A public key cryptosystem and a signature scheme based on discrete logarithms
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- scientific article; zbMATH DE number 3574054 (Why is no real title available?)
- scientific article; zbMATH DE number 1305088 (Why is no real title available?)
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- Quantum algorithm for discrete logarithm problem for matrices over finite group rings
This page was built for publication: Improved cryptanalysis of a ElGamal cryptosystem based on matrices over group rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033526)