HFERP - A new multivariate encryption scheme

Yasuhiko Ikematsu, Ray Perlner, Daniel Smith-Tone, Tsuyoshi Takagi, Jeremy Vates

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

2 Citations (Scopus)

Abstract

In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP. The scheme achieved a smaller blow-up factor between the plaintext space and ciphertext space than most recent multivariate encryption proposals, but proved to be too aggressive and was completely broken by Perlner et al. in 2017. The scheme suffered from the same MinRank weakness that has allowed effective attacks on several notable big field multivariate schemes: HFE, multi-HFE, HFE-, for example. We propose a related new encryption scheme retaining the desirable traits of SRP and patching its weaknesses. We call the scheme HFERP because it utilizes a similar construction as SRP with an HFE primitive replacing the Square polynomial. The effect of this substitution is to increase the Q-rank of the pubic key to such a degree that the MinRank attack is impossible. HFERP still retains the relatively small blow-up factor between the plaintext space and ciphertext space, and is thus a candidate for secure multivariate encryption without an essential doubling in size between plaintext and ciphertext.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings
EditorsTanja Lange, Rainer Steinwandt
PublisherSpringer Verlag
Pages396-416
Number of pages21
ISBN (Print)9783319790626
DOIs
Publication statusPublished - Jan 1 2018
Event9th International Conference on Post-Quantum Cryptography, PQCrypto 2018 - Fort Lauderdale, United States
Duration: Apr 9 2018Apr 11 2018

Publication series

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

Other

Other9th International Conference on Post-Quantum Cryptography, PQCrypto 2018
CountryUnited States
CityFort Lauderdale
Period4/9/184/11/18

Fingerprint

Encryption
Cryptography
Blow-up
Attack
Doubling
Substitution reactions
Polynomials
Substitution
Polynomial

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ikematsu, Y., Perlner, R., Smith-Tone, D., Takagi, T., & Vates, J. (2018). HFERP - A new multivariate encryption scheme. In T. Lange, & R. Steinwandt (Eds.), Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings (pp. 396-416). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10786 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-79063-3_19

HFERP - A new multivariate encryption scheme. / Ikematsu, Yasuhiko; Perlner, Ray; Smith-Tone, Daniel; Takagi, Tsuyoshi; Vates, Jeremy.

Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings. ed. / Tanja Lange; Rainer Steinwandt. Springer Verlag, 2018. p. 396-416 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10786 LNCS).

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

Ikematsu, Y, Perlner, R, Smith-Tone, D, Takagi, T & Vates, J 2018, HFERP - A new multivariate encryption scheme. in T Lange & R Steinwandt (eds), Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10786 LNCS, Springer Verlag, pp. 396-416, 9th International Conference on Post-Quantum Cryptography, PQCrypto 2018, Fort Lauderdale, United States, 4/9/18. https://doi.org/10.1007/978-3-319-79063-3_19
Ikematsu Y, Perlner R, Smith-Tone D, Takagi T, Vates J. HFERP - A new multivariate encryption scheme. In Lange T, Steinwandt R, editors, Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings. Springer Verlag. 2018. p. 396-416. (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-79063-3_19
Ikematsu, Yasuhiko ; Perlner, Ray ; Smith-Tone, Daniel ; Takagi, Tsuyoshi ; Vates, Jeremy. / HFERP - A new multivariate encryption scheme. Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings. editor / Tanja Lange ; Rainer Steinwandt. Springer Verlag, 2018. pp. 396-416 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9f77cb35948c4cd8845a4ca7e24e507a,
title = "HFERP - A new multivariate encryption scheme",
abstract = "In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP. The scheme achieved a smaller blow-up factor between the plaintext space and ciphertext space than most recent multivariate encryption proposals, but proved to be too aggressive and was completely broken by Perlner et al. in 2017. The scheme suffered from the same MinRank weakness that has allowed effective attacks on several notable big field multivariate schemes: HFE, multi-HFE, HFE-, for example. We propose a related new encryption scheme retaining the desirable traits of SRP and patching its weaknesses. We call the scheme HFERP because it utilizes a similar construction as SRP with an HFE primitive replacing the Square polynomial. The effect of this substitution is to increase the Q-rank of the pubic key to such a degree that the MinRank attack is impossible. HFERP still retains the relatively small blow-up factor between the plaintext space and ciphertext space, and is thus a candidate for secure multivariate encryption without an essential doubling in size between plaintext and ciphertext.",
author = "Yasuhiko Ikematsu and Ray Perlner and Daniel Smith-Tone and Tsuyoshi Takagi and Jeremy Vates",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-79063-3_19",
language = "English",
isbn = "9783319790626",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "396--416",
editor = "Tanja Lange and Rainer Steinwandt",
booktitle = "Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings",
address = "Germany",

}

TY - GEN

T1 - HFERP - A new multivariate encryption scheme

AU - Ikematsu, Yasuhiko

AU - Perlner, Ray

AU - Smith-Tone, Daniel

AU - Takagi, Tsuyoshi

AU - Vates, Jeremy

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP. The scheme achieved a smaller blow-up factor between the plaintext space and ciphertext space than most recent multivariate encryption proposals, but proved to be too aggressive and was completely broken by Perlner et al. in 2017. The scheme suffered from the same MinRank weakness that has allowed effective attacks on several notable big field multivariate schemes: HFE, multi-HFE, HFE-, for example. We propose a related new encryption scheme retaining the desirable traits of SRP and patching its weaknesses. We call the scheme HFERP because it utilizes a similar construction as SRP with an HFE primitive replacing the Square polynomial. The effect of this substitution is to increase the Q-rank of the pubic key to such a degree that the MinRank attack is impossible. HFERP still retains the relatively small blow-up factor between the plaintext space and ciphertext space, and is thus a candidate for secure multivariate encryption without an essential doubling in size between plaintext and ciphertext.

AB - In 2016, Yasuda et al. presented a new multivariate encryption technique based on the Square and Rainbow primitives and utilizing the plus modifier that they called SRP. The scheme achieved a smaller blow-up factor between the plaintext space and ciphertext space than most recent multivariate encryption proposals, but proved to be too aggressive and was completely broken by Perlner et al. in 2017. The scheme suffered from the same MinRank weakness that has allowed effective attacks on several notable big field multivariate schemes: HFE, multi-HFE, HFE-, for example. We propose a related new encryption scheme retaining the desirable traits of SRP and patching its weaknesses. We call the scheme HFERP because it utilizes a similar construction as SRP with an HFE primitive replacing the Square polynomial. The effect of this substitution is to increase the Q-rank of the pubic key to such a degree that the MinRank attack is impossible. HFERP still retains the relatively small blow-up factor between the plaintext space and ciphertext space, and is thus a candidate for secure multivariate encryption without an essential doubling in size between plaintext and ciphertext.

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

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

U2 - 10.1007/978-3-319-79063-3_19

DO - 10.1007/978-3-319-79063-3_19

M3 - Conference contribution

AN - SCOPUS:85045392094

SN - 9783319790626

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

SP - 396

EP - 416

BT - Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Proceedings

A2 - Lange, Tanja

A2 - Steinwandt, Rainer

PB - Springer Verlag

ER -