A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Towards Provable Security of the Unbalanced Oil and Vinegar Signature Scheme under Direct Attacks
[chapter]
2010
Lecture Notes in Computer Science
In this paper we show that solving systems coming from the public key of the Unbalanced Oil and Vinegar (UOV) signature scheme is on average at least as hard as solving a certain quadratic system with completely random quadratic part. In providing lower bounds on direct attack complexity we rely on the empirical fact that complexity of solving a non-linear polynomial system is determined by the homogeneous part of this system of the highest degree. Our reasoning explains, in particular, the
doi:10.1007/978-3-642-17401-8_3
fatcat:47zrvxvj2festfjm7xq4f7izue