Cryptanalysis of a non-commutative key exchange protocol
This work addresses vulnerabilities in cryptographic protocols for secure communication, representing an incremental improvement in cryptanalysis.
The paper tackles the security of non-commutative key exchange protocols by presenting a polynomial-time attack that breaks variants from prior works and reduces breaking a patented cryptosystem to factoring, with examples demonstrating efficient attack performance.
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.