Equivalent Keys in HFE, C*, and Variations
Author(s) -
Christopher Wolf,
Bart Preneel
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-28938-0
DOI - 10.1007/11554868_4
Subject(s) - cryptanalysis , public key cryptography , extension (predicate logic) , computer science , key (lock) , discrete mathematics , implementation , theoretical computer science , mathematics , algorithm , cryptography , computer security , encryption , programming language
In this article, we investigate the question of equivalent keys for two ${\mathcal M}$ultivariate ${\mathcal Q}$uadratic public key schemes HFE and C*−− and improve over a previously known result, which appeared at PKC 2005. Moreover, we show a new non-trivial extension of these results to the classes HFE-, HFEv, HFEv-, and C*−−, which are cryptographically stronger variants of the original HFE and C* schemes. In particular, we are able to reduce the size of the private — and hence the public — key space by at least one order of magnitude and several orders of magnitude on average. While the results are of independent interest themselves as they broaden our understanding of ${\mathcal M}$ultivariate ${\mathcal Q}$uadratic schemes, we also see applications both in cryptanalysis and in memory efficient implementations.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom