Cryptanalysis of a noncommutative key exchange protocol
From MaRDI portal
Abstract: In the papers by Alvarez et al. and Pathak and Sanghi a non-commutative based public key exchange is described. A similiar version of it has also been patented (US7184551). In this paper we present a polynomial time attack that breaks the variants of the protocol presented in the two papers. Moreover we show that breaking the patented cryptosystem US7184551 can be easily reduced to factoring. We also give some examples to show how efficiently the attack works.
Recommendations
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- An improvement of the Diffie-Hellman noncommutative protocol
- Key exchange protocols over noncommutative rings. The case of End(\(\mathbb Z_p \times \mathbb Z_{p^{2}}\))
- A Diffie-Hellman key exchange protocol using matrices over noncommutative rings
- Schemes of public distribution of a key based on a noncommutative operation
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- A general construction for monoid-based knapsack protocols
- A method for obtaining digital signatures and public-key cryptosystems
- A new efficient algorithm for computing Gröbner bases (F₄)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Analysis and design of a secure key exchange scheme
- Cryptanalysis of a 2-party key establishment based on a semigroup action problem
- Cryptanalysis of a key exchange scheme based on block matrices
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Linear spanning sets for matrix spaces
- New directions in cryptography
- Public key cryptography based on semigroup actions
Cited in
(16)- A linear algebra attack on the non-commuting cryptography class based on matrix power function
- On the algebraic structure of \(E_p^{(m)}\) and applications to cryptography
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- The "Elliptic" matrices and a new kind of cryptography
- A key exchange protocol using matrices over group ring
- Key Exchange and Encryption Schemes Based on Non-commutative Skew Polynomials
- Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra
- Cryptanalysis of cryptosystems based on non-commutative skew polynomials
- Group key management based on semigroup actions
- A new undeniable signature scheme on general linear group over group ring
- Cryptanalysis of the CLR-cryptosystem
- Linear spanning sets for matrix spaces
- An improvement of the Diffie-Hellman noncommutative protocol
- An attack on a non-interactive key exchange from code equivalence
- Cryptanalysis via algebraic spans
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants
This page was built for publication: Cryptanalysis of a noncommutative key exchange protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346714)
