Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 9289410, 6 pages
Research Article

Building Secure Public Key Encryption Scheme from Hidden Field Equations

1School of Information Engineering, Xuchang University, Xuchang 461000, China
2Guizhou Provincial Key Laboratory of Public Big Data, Guiyang 550025, China
3State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China

Correspondence should be addressed to Baocang Wang; moc.nuyila@97gnawcb

Received 4 April 2017; Accepted 5 June 2017; Published 10 July 2017

Academic Editor: Dengpan Ye

Copyright © 2017 Yuan Ping et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Multivariate public key cryptography is a set of cryptographic schemes built from the NP-hardness of solving quadratic equations over finite fields, amongst which the hidden field equations (HFE) family of schemes remain the most famous. However, the original HFE scheme was insecure, and the follow-up modifications were shown to be still vulnerable to attacks. In this paper, we propose a new variant of the HFE scheme by considering the special equation defined over the finite field when . We observe that the equation can be used to further destroy the special structure of the underlying central map of the HFE scheme. It is shown that the proposed public key encryption scheme is secure against known attacks including the MinRank attack, the algebraic attacks, and the linearization equations attacks. The proposal gains some advantages over the original HFE scheme with respect to the encryption speed and public key size.