Revisiting the efficient key generation of ZHFE

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 of the ZHFE scheme. Our algorithm reduces the complexity from O(n2ω+1) by Baena et al. to O(nω+3), where n is the number of variables and 2 <ω<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 be the best appropriate for the ZHFE scheme.

Original languageEnglish
Title of host publicationCodes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet
EditorsAbderrahmane Nitaj, Said El Hajji, El Mamoun Souidi
PublisherSpringer Verlag
Pages195-212
Number of pages18
ISBN (Print)9783319555881
DOIs
Publication statusPublished - Jan 1 2017
Event2nd International Conference on Codes, Cryptology and Information Security, C2SI 2017 - Rabat, Morocco
Duration: Apr 10 2017Apr 12 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10194 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Codes, Cryptology and Information Security, C2SI 2017
CountryMorocco
City Rabat
Period4/10/174/12/17

Fingerprint

Cryptography
Linear algebra
Cryptosystem
Encryption
Efficient Algorithms
Estimate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ikematsu, Y., Duong, D. H., Petzoldt, A., & Takagi, T. (2017). Revisiting the efficient key generation of ZHFE. In A. Nitaj, S. El Hajji, & E. M. Souidi (Eds.), Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet (pp. 195-212). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10194 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-55589-8_13

Revisiting the efficient key generation of ZHFE. / Ikematsu, Yasuhiko; Duong, Dung H.; Petzoldt, Albrecht; Takagi, Tsuyoshi.

Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet. ed. / Abderrahmane Nitaj; Said El Hajji; El Mamoun Souidi. Springer Verlag, 2017. p. 195-212 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10194 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ikematsu, Y, Duong, DH, Petzoldt, A & Takagi, T 2017, Revisiting the efficient key generation of ZHFE. in A Nitaj, S El Hajji & EM Souidi (eds), Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10194 LNCS, Springer Verlag, pp. 195-212, 2nd International Conference on Codes, Cryptology and Information Security, C2SI 2017, Rabat, Morocco, 4/10/17. https://doi.org/10.1007/978-3-319-55589-8_13
Ikematsu Y, Duong DH, Petzoldt A, Takagi T. Revisiting the efficient key generation of ZHFE. In Nitaj A, El Hajji S, Souidi EM, editors, Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet. Springer Verlag. 2017. p. 195-212. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-55589-8_13
Ikematsu, Yasuhiko ; Duong, Dung H. ; Petzoldt, Albrecht ; Takagi, Tsuyoshi. / Revisiting the efficient key generation of ZHFE. Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet. editor / Abderrahmane Nitaj ; Said El Hajji ; El Mamoun Souidi. Springer Verlag, 2017. pp. 195-212 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dbdb86d5af50471784447f086b810fbd,
title = "Revisiting the efficient key generation of ZHFE",
abstract = "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 of the ZHFE scheme. Our algorithm reduces the complexity from O(n2ω+1) by Baena et al. to O(nω+3), where n is the number of variables and 2 <ω<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 be the best appropriate for the ZHFE scheme.",
author = "Yasuhiko Ikematsu and Duong, {Dung H.} and Albrecht Petzoldt and Tsuyoshi Takagi",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-55589-8_13",
language = "English",
isbn = "9783319555881",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "195--212",
editor = "Abderrahmane Nitaj and {El Hajji}, Said and Souidi, {El Mamoun}",
booktitle = "Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet",
address = "Germany",

}

TY - GEN

T1 - Revisiting the efficient key generation of ZHFE

AU - Ikematsu, Yasuhiko

AU - Duong, Dung H.

AU - Petzoldt, Albrecht

AU - Takagi, Tsuyoshi

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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 of the ZHFE scheme. Our algorithm reduces the complexity from O(n2ω+1) by Baena et al. to O(nω+3), where n is the number of variables and 2 <ω<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 be the best appropriate for the ZHFE scheme.

AB - 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 of the ZHFE scheme. Our algorithm reduces the complexity from O(n2ω+1) by Baena et al. to O(nω+3), where n is the number of variables and 2 <ω<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 be the best appropriate for the ZHFE scheme.

UR - http://www.scopus.com/inward/record.url?scp=85015256282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015256282&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-55589-8_13

DO - 10.1007/978-3-319-55589-8_13

M3 - Conference contribution

AN - SCOPUS:85015256282

SN - 9783319555881

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 195

EP - 212

BT - Codes, Cryptology and Information Security - 2nd International Conference, C2SI 2017, Proceedings In Honor of Claude Carlet

A2 - Nitaj, Abderrahmane

A2 - El Hajji, Said

A2 - Souidi, El Mamoun

PB - Springer Verlag

ER -