MQ Does Not Reduce to TUOV

Laura Maddison

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): -- withdrawn --
Category: Attacks and cryptanalysis
Publication info: Preprint.
Keywords: TUOV UOV signature scheme multivariate
Contact author(s): lmadd036 @ uottawa ca
History: 2024-04-25: withdrawn; 2024-02-08: received; See all versions
Short URL: https://ia.cr/2024/193
License: CC BY