Paper 2024/193

MQ Does Not Reduce to TUOV

Laura Maddison, University of Ottawa
Abstract

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.

Metadata
Available format(s)
PDF
Category
Attacks and cryptanalysis
Publication info
Preprint.
Keywords
TUOVUOVsignature schememultivariate
Contact author(s)
lmadd036 @ uottawa ca
History
2024-02-09: approved
2024-02-08: received
See all versions
Short URL
https://ia.cr/2024/193
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/193,
      author = {Laura Maddison},
      title = {MQ Does Not Reduce to TUOV},
      howpublished = {Cryptology ePrint Archive, Paper 2024/193},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/193}},
      url = {https://eprint.iacr.org/2024/193}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.