In this article, we show that public key schemes based on multivariate quadratic equations allow many equivalent, and hence superfluous private keys. We achieve this result by investigating several transformations to identify these keys and show their application to Hidden Field Equations (HFE), C*, and Unbalanced Oil and Vinegar schemes (UOV). In all cases, we are able to reduce the size of the private - and hence the public - key space by at least one order of magnitude. We see applications of our technique both in cryptanalysis of these schemes and in memory efficient implementations. © International Association for Cryptologic Research 2005.
CITATION STYLE
Wolf, C., & Preneel, B. (2005). Large superfluous keys in multivariate quadratic asymmetric systems. In Lecture Notes in Computer Science (Vol. 3386, pp. 275–287). Springer Verlag. https://doi.org/10.1007/978-3-540-30580-4_19
Mendeley helps you to discover research relevant for your work.