Bulygin, Stanislav ; Petzoldt, Albrecht ; Buchmann, Johannes
Hrsg.: Gong, G. ; Gupta, K. C. (2010)
Towards provable security of the Unbalanced Oil and Vinegar signature scheme under direct attacks.
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
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 results on solving the UOV systems presented by J.-C. Faugere and L. Perret at the SCC conference in 2008.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2010 |
| Herausgeber: | Gong, G. ; Gupta, K. C. |
| Autor(en): | Bulygin, Stanislav ; Petzoldt, Albrecht ; Buchmann, Johannes |
| Art des Eintrags: | Bibliographie |
| Titel: | Towards provable security of the Unbalanced Oil and Vinegar signature scheme under direct attacks |
| Sprache: | Englisch |
| Publikationsjahr: | Dezember 2010 |
| Verlag: | Springer |
| Buchtitel: | Proceedings of IndoCrypt 2010 |
| Reihe: | Lecture Notes in Computer Science |
| Band einer Reihe: | 6498 |
| Kurzbeschreibung (Abstract): | 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 results on solving the UOV systems presented by J.-C. Faugere and L. Perret at the SCC conference in 2008. |
| Freie Schlagworte: | Secure Data;Multivariate Cryptography, UOV Signature Scheme, provable security, security reduction, semi-regular sequence |
| ID-Nummer: | TUD-CS-2010-0230 |
| Fachbereich(e)/-gebiet(e): | LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra LOEWE > LOEWE-Zentren 20 Fachbereich Informatik LOEWE |
| Hinterlegungsdatum: | 30 Dez 2016 20:23 |
| Letzte Änderung: | 17 Mai 2018 13:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum