ZHFE, A New Multivariate Public Key Encryption Scheme

Jaiberth Porras; John Baena; Jintai Ding

doi:10.1007/978-3-319-11659-4_14

ZHFE, A New Multivariate Public Key Encryption Scheme

Jaiberth Porras, John Baena, Jintai Ding^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

60 Citations (Scopus)

Abstract

In this paper we propose a new multivariate public key encryption scheme named ZHFE. The public key is constructed using as core map two high rank HFE polynomials. The inversion of the public key is performed using a low degree polynomial of Hamming weight three. This low degree polynomial is obtained from the two high rank HFE polynomials, by means of a special reduction method that uses Hamming weight three polynomials produced from the two high rank HFE polynomials. We show that ZHFE is relatively efficient and that it is secure against the main attacks that have threatened the security of HFE. We also propose parameters for a practical implementation of ZHFE.

Original language	English
Pages (from-to)	229-245
Number of pages	17
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8772
DOIs	https://doi.org/10.1007/978-3-319-11659-4_14
Publication status	Published - 2014
Externally published	Yes

Keywords

HFE cryptosystem
HFE polynomials
Multivariate cryptography
Trapdoor functions
Zhuang-zi algorithm

Access to Document

10.1007/978-3-319-11659-4_14

Cite this

@article{00f43e6b146f41e6af1413c40b7fbcb2,

title = "ZHFE, A New Multivariate Public Key Encryption Scheme",

abstract = "In this paper we propose a new multivariate public key encryption scheme named ZHFE. The public key is constructed using as core map two high rank HFE polynomials. The inversion of the public key is performed using a low degree polynomial of Hamming weight three. This low degree polynomial is obtained from the two high rank HFE polynomials, by means of a special reduction method that uses Hamming weight three polynomials produced from the two high rank HFE polynomials. We show that ZHFE is relatively efficient and that it is secure against the main attacks that have threatened the security of HFE. We also propose parameters for a practical implementation of ZHFE.",

keywords = "HFE cryptosystem, HFE polynomials, Multivariate cryptography, Trapdoor functions, Zhuang-zi algorithm",

author = "Jaiberth Porras and John Baena and Jintai Ding",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2014.",

year = "2014",

doi = "10.1007/978-3-319-11659-4_14",

language = "English",

volume = "8772",

pages = "229--245",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

}

TY - JOUR

T1 - ZHFE, A New Multivariate Public Key Encryption Scheme

AU - Porras, Jaiberth

AU - Baena, John

AU - Ding, Jintai

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2014.

PY - 2014

Y1 - 2014

N2 - In this paper we propose a new multivariate public key encryption scheme named ZHFE. The public key is constructed using as core map two high rank HFE polynomials. The inversion of the public key is performed using a low degree polynomial of Hamming weight three. This low degree polynomial is obtained from the two high rank HFE polynomials, by means of a special reduction method that uses Hamming weight three polynomials produced from the two high rank HFE polynomials. We show that ZHFE is relatively efficient and that it is secure against the main attacks that have threatened the security of HFE. We also propose parameters for a practical implementation of ZHFE.

AB - In this paper we propose a new multivariate public key encryption scheme named ZHFE. The public key is constructed using as core map two high rank HFE polynomials. The inversion of the public key is performed using a low degree polynomial of Hamming weight three. This low degree polynomial is obtained from the two high rank HFE polynomials, by means of a special reduction method that uses Hamming weight three polynomials produced from the two high rank HFE polynomials. We show that ZHFE is relatively efficient and that it is secure against the main attacks that have threatened the security of HFE. We also propose parameters for a practical implementation of ZHFE.

KW - HFE cryptosystem

KW - HFE polynomials

KW - Multivariate cryptography

KW - Trapdoor functions

KW - Zhuang-zi algorithm

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

U2 - 10.1007/978-3-319-11659-4_14

DO - 10.1007/978-3-319-11659-4_14

M3 - Article

AN - SCOPUS:84921635098

SN - 0302-9743

VL - 8772

SP - 229

EP - 245

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

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

ER -

ZHFE, A New Multivariate Public Key Encryption Scheme

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this