TY - GEN
T1 - On the security and key generation of the ZHFE encryption scheme
AU - Zhang, Wenbin
AU - Tan, Chik How
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - At PQCrypto’14 Porras, Baena and Ding proposed a new interesting construction to overcome the security weakness of the HFE encryption scheme, and called their new encryption scheme ZHFE. They provided experimental evidence for the security of ZHFE, and proposed the parameter set (q, n,D) = (7, 55, 105) with claimed security level 280 estimated by experiment. However there is an important gap in the stateof- the-art cryptanalysis of ZHFE, i.e., a sound theoretical estimation for the security level of ZHFE is missing. In this paper we fill in this gap by computing upper bounds for the Q-Rank and for the degree of regularity of ZHFE in terms of logq D, and thus providing such a theoretical estimation. For instance the security level of ZHFE(7,55,105) can now be estimated theoretically as at least 296. Moreover for the inefficient key generation of ZHFE, we also provide a solution to improve it significantly, making almost no computation needed.
AB - At PQCrypto’14 Porras, Baena and Ding proposed a new interesting construction to overcome the security weakness of the HFE encryption scheme, and called their new encryption scheme ZHFE. They provided experimental evidence for the security of ZHFE, and proposed the parameter set (q, n,D) = (7, 55, 105) with claimed security level 280 estimated by experiment. However there is an important gap in the stateof- the-art cryptanalysis of ZHFE, i.e., a sound theoretical estimation for the security level of ZHFE is missing. In this paper we fill in this gap by computing upper bounds for the Q-Rank and for the degree of regularity of ZHFE in terms of logq D, and thus providing such a theoretical estimation. For instance the security level of ZHFE(7,55,105) can now be estimated theoretically as at least 296. Moreover for the inefficient key generation of ZHFE, we also provide a solution to improve it significantly, making almost no computation needed.
KW - HFE
KW - Multivariate public key cryptography
KW - Post-quantum cryptography
KW - ZHFE
UR - https://www.scopus.com/pages/publications/84988012799
U2 - 10.1007/978-3-319-44524-3_17
DO - 10.1007/978-3-319-44524-3_17
M3 - Conference Proceeding
AN - SCOPUS:84988012799
SN - 9783319445236
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 289
EP - 304
BT - Advances in Information and Computer Security - 11th International Workshop on Security, IWSEC 2016, Proceedings
A2 - Yoshioka, Katsunari
A2 - Ogawa, Kazuto
PB - Springer Verlag
T2 - 11th International Workshop on Security on Advances in Information and Computer Security, IWSEC 2016
Y2 - 12 September 2016 through 14 September 2016
ER -