Revisiting the Minrank Problem on Multivariate Cryptography
2020
The minrank problem is often considered in the cryptanalysis of multivariate cryptography and code-based cryptography. There have been many multivariate cryptosystems proven insecure due to their weakness against the minrank attack, which is an attack that transforms breaking a cryptosystem into solving a minrank problem instance.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
31
References
0
Citations
NaN
KQI