Cryptanalysis of “MAKE”
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2022-02-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2021-0016 |