A Diffie–Hellman key exchange protocol using matrices over noncommutative rings
نویسندگان
چکیده
منابع مشابه
Public Key Exchange Using Matrices Over Group Rings
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but weuse (small) matrices over a group ring of a (small) symmetric group as the platform. This“nested structure” of the platform makes computation very efficient for legitimate parties.We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) andComputational Diffie-Hellman (CDH) p...
متن کاملKey exchange protocols over noncommutative rings. The case of
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.
متن کاملCryptanalysis of a noncommutative key exchange protocol
In the papers by Alvarez et al. and Pathak and Sanghi a noncommutative 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...
متن کاملA Diffie-Hellman Key Exchange Using Matrices Over Non Commutative Rings
We consider a key exchange procedure whose security is based on the difficulty of computing discrete logarithms in a group, and where exponentiation is hidden by a conjugation. We give a platform-dependent cryptanalysis of this protocol. Finally, to take full advantage of this procedure, we propose a group of matrices over a noncommutative ring as platform group.
متن کاملKey Exchange Protocol over Insecure Channel
Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing secure cryptographic algorithms is hard, and keeping the keys secret is much harder. Cryptanalysts usually attack both symmetric and public key cryptosystems through ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups - Complexity - Cryptology
سال: 2012
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc-2012-0001