Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
An Efficient Key Generation of ZHFE Public Key Cryptosystem Yasuhiko IKEMATSU Dung Hoang DUONG Albrecht PETZOLDT Tsuyoshi TAKAGI Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E101-A No.1 pp.29-38 Publication Date: 2018/01/01 Online ISSN: 1745-1337 DOI: 10.1587/transfun.E101.A.29 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: post-quantum cryptography, multivariate cryptography, encryption schemes, ZHFE, Full Text: PDF(1.5MB)>>
Summary: ZHFE, proposed by Porras et al. 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 and estimate the number of possible keys generated by all existing private key generation algorithms for the ZHFE scheme. Our algorithm generates as many private ZHFE keys as the original and Baena et al.'s ones and reduces the complexity from O(n2ω+1) by Baena et al. to O(nω+3), where n is the number of variables and ω is a linear algebra constant. Moreover, we also analyze when the decryption of the ZHFE scheme does not work. | ||||||||||
| ||||||||||
