It was recently demonstrated that the Matrix Action Key Exchange (MAKE) algorithm, a new type of key exchange protocol using the semidirect product of matrix groups, is vulnerable to a linear algebraic attack if the matrices are over a commutative ring. In this note, we establish conditions under which protocols using matrices over a non-commutative ring are also vulnerable to this attack. We then demonstrate that group rings R[G] used in arXiv:1304.6572, where R is a commutative ring and G is a non-abelian group, are examples of non-commutative rings that satisfy these conditions
In this paper we cryptanalyze two protocols: Grigoriev-Shpilrain authentication protocol and Wang et...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...
In this paper we use the nonrepresentable ring E_p(m) to introduce public key cryptosystems in nonco...
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
Abstract. In this paper we analyze the Kahrobaei-Lam-Shpilrain (KLS) key exchange protocols that use...
We propose a cryptosystem based on matrices over group rings and claim that it is secure against ada...
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm p...
In this article, we present a new key exchange protocol which works in the division semiring. We pro...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
Modern communication relies on cryptography to ensure the security, integrity, and authenticity of o...
Key management is a central problem in information security. The development of quantum computation ...
Many of the asymmetric cryptography protocols are based on operations performed on commutative algeb...
In this paper we cryptanalyze two protocols: Grigoriev-Shpilrain authentication protocol and Wang et...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...
In this paper we use the nonrepresentable ring E_p(m) to introduce public key cryptosystems in nonco...
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
Abstract. In this paper we analyze the Kahrobaei-Lam-Shpilrain (KLS) key exchange protocols that use...
We propose a cryptosystem based on matrices over group rings and claim that it is secure against ada...
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm p...
In this article, we present a new key exchange protocol which works in the division semiring. We pro...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
In this paper we introduce some key exchange protocols over noncommutative rings. These protocols us...
Modern communication relies on cryptography to ensure the security, integrity, and authenticity of o...
Key management is a central problem in information security. The development of quantum computation ...
Many of the asymmetric cryptography protocols are based on operations performed on commutative algeb...
In this paper we cryptanalyze two protocols: Grigoriev-Shpilrain authentication protocol and Wang et...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...
In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic ...