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.
שמור ב:
| Principais autores: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
De Gruyter
2022-02-01
|
| סדרה: | Journal of Mathematical Cryptology |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.1515/jmc-2021-0016 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|