Security analysis of an improved MFE public key cryptosystem

Authors:
Xuyun Nie;Zhaohu Xu;Li Lu;Yongjian Liao
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
Venue:
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Year:
2011

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
High order linearization equation (HOLE) attack on multivariate public key cryptosystems

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A "medium-field" multivariate public-key encryption scheme

CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Cryptanalysis of two quartic encryption schemes and one improved MFE scheme

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

MFE is a multivariate public key encryption scheme. In 2007, MFE was broken by Ding et al using high order linearization equation attack. In 2009, Huang et al gave an improvement of MFE. They claimed that the improved MFE is secure against high order linearization equation attack. However, through theoretical analysis, we find that there are many first order linearization equations(FOLEs) satisfied by this improved version. Using linearization equation attack can break this version. We also find the improved version satisfied Second Order Linearization Equantions (SOLEs).