Building Secure Public Key Encryption Scheme from Hidden Field Equations. (10th July 2017)

• Record Type: Journal Article
• Authors: Ping, Yuan; Wang, Baocang; Yang, Yuehua; Tian, Shengli
• Other Names: Ye Dengpan Academic Editor.
• Is Part Of: Security and communication networks. Volume 2017(2017)
• Publication Date: 2017-07-10
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1155/2017/9289410
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract : 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 x 2 = x defined over the finite field F 3 when x = 0, 1 . 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.