Cryptology ePrint Archive: Report 2016/1065

Revisiting the Efficient Key Generation of ZHFE

Yasuhiko Ikematsu and Dung H. Duong and Albrecht Petzoldt and Tsuyoshi Takagi

Abstract: ZHFE, proposed by Porras at el. at PQCrypto'14, is one of the very few existing multivariate encryption schemes and a very promising candidate for post-quantum cryptosystems. The only one drawback is its slow key generation. At PQCrypto'16, Baena et al. proposed an algorithm to construct the private ZHFE keys, which is much faster than the original algorithm, but still inefficient for practical parameters. Recently, Zhang and Tan proposed another private key generation algorithm, which is very fast but not necessarily able to generate all the private ZHFE keys. In this paper we propose a new efficient algorithm for the private key generation of the ZHFE scheme. Our algorithm reduces the complexity from $O(n^{2Ľomega+1})$ by Baena et al. to $O(n^{Ľomega+3})$, where $n$ is the number of variables and $2<Ľomega<3$ is a linear algebra constant. We also estimate the number of possible keys generated by all existing private key generation algorithms for ZHFE. Our algorithm generates as many private ZHFE keys as the original and Baena et al.'s ones. This makes our algorithm is the best appropriate for the ZHFE scheme.

Category / Keywords: public-key cryptography / quantum cryptography and multivariate cryptography and ZHFE

Date: received 14 Nov 2016

Contact author: y-ikematsu at imi kyushu-u ac jp

Available format(s): PDF | BibTeX Citation

Version: 20161115:150938 (All versions of this report)

Short URL: ia.cr/2016/1065

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]