Cryptanalysis of “MAKE”

Abstract

Rahman and Shpilrain proposed a Diffie–Hellman style key exchange based on a semidirect product of n×nn\times n-matrices over a finite field. We show that, using public information, an adversary can recover the agreed upon secret key by solving a system of n2{n}^{2} linear equations.

Keywords

• public key cryptography
• key exchange
• matrix-based
• cryptanalysis
• 94a60
• 11t71
• 15b33