[Resource Topic] 2024/193: MQ Does Not Reduce to TUOV

Welcome to the resource topic for 2024/193

MQ Does Not Reduce to TUOV

Authors: Laura Maddison


The submission of the Triangular Unbalanced Oil and Vinegar (TUOV) digital signature scheme to the NIST competition in 2023 claims that if the Multivariate Quadratic (MQ) problem (with suitable parameters) is hard, then the TUOV problem must also be hard. We show why the proof fails and why the claimed theorem cannot be true in general.

ePrint: https://eprint.iacr.org/2024/193

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .