In this paper we introduce some key exchange protocols over noncommutative rings. These protocols use some polynomials with coefficients in the center of the ring as part of the private keys. We give some examples over the ring End(Zp × Zp2), where p is a prime number. We also give a security analysis of the proposed protocols and conclude that the only possible attack is by brute force.Partially supported by Spanish grant MTM2011-24858 of the Ministerio de Economía y Competitividad of the Gobierno de España
Protocols for authenticated key exchange allow parties within an insecure network to establish a com...
Authentication is a process by which an entity, which could be a person or intended computer, establ...
Title: Applications of Gröbner bases in cryptography Author: Aleš Fuchs Department: Department of Al...
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...
In this paper we use the nonrepresentable ring E_p(m) to introduce public key cryptosystems in nonco...
For a prime number p , Bergman (Israel J Math 18:257–277, 1974) established that End(Zp×Zp2) is a se...
We propose building a new PKC in a ring structure, the classification of rings being an open problem...
In this article, we present a new key exchange protocol which works in the division semiring. We pro...
It was recently demonstrated that the Matrix Action Key Exchange (MAKE) algorithm, a new type of key...
In this paper we propose new key agreement protocols based on multivariate algebraic equations. We c...
Key management is a central problem in information security. The development of quantum computation ...
Post-quantum cryptography (PQC) is a trend that has a deserved NIST status, and which aims to be res...
The key exchange protocol is a method of securely sharing cryptographic keys over a public channel. ...
Many of the asymmetric cryptography protocols are based on operations performed on commutative algeb...
Protocols for authenticated key exchange allow parties within an insecure network to establish a com...
Authentication is a process by which an entity, which could be a person or intended computer, establ...
Title: Applications of Gröbner bases in cryptography Author: Aleš Fuchs Department: Department of Al...
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...
In this paper we use the nonrepresentable ring E_p(m) to introduce public key cryptosystems in nonco...
For a prime number p , Bergman (Israel J Math 18:257–277, 1974) established that End(Zp×Zp2) is a se...
We propose building a new PKC in a ring structure, the classification of rings being an open problem...
In this article, we present a new key exchange protocol which works in the division semiring. We pro...
It was recently demonstrated that the Matrix Action Key Exchange (MAKE) algorithm, a new type of key...
In this paper we propose new key agreement protocols based on multivariate algebraic equations. We c...
Key management is a central problem in information security. The development of quantum computation ...
Post-quantum cryptography (PQC) is a trend that has a deserved NIST status, and which aims to be res...
The key exchange protocol is a method of securely sharing cryptographic keys over a public channel. ...
Many of the asymmetric cryptography protocols are based on operations performed on commutative algeb...
Protocols for authenticated key exchange allow parties within an insecure network to establish a com...
Authentication is a process by which an entity, which could be a person or intended computer, establ...
Title: Applications of Gröbner bases in cryptography Author: Aleš Fuchs Department: Department of Al...