Paper 2021/465 Original: eprint.iacr.org/2021/465 ↗
Cryptanalysis of `MAKE'
Abstract
In a recent eprint, Rahman and Shpilrain proposed a Diffie-Hellman style key exchange based on a semidirect product of $n × 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 $n^2$ linear equations.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-04-12: last updated
- 2021-04-12: published
- Short URL
- https://ia.cr/2021/465
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/465,
author = {Daniel Brown and Neal Koblitz and Jason LeGrow},
title = {Cryptanalysis of `MAKE'},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/465},
year = {2021},
url = {https://eprint.iacr.org/2021/465}
}