Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The Security of Hidden Field Equations (HFE)
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
FLASH, a Fast Multivariate Signature Algorithm
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Fast and Secure Implementation of Sflash
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Building secure tame-like multivariate public-key cryptosystems: the new TTS
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
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
Tractable rational map signature
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Cryptanalysis of HFEv and internal perturbation of HFE
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Rainbow, a new multivariable polynomial signature scheme
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Differential cryptanalysis for multivariate schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A New Construction of Multivariate Public Key Encryption Scheme through Internally Perturbed Plus
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Cryptanalysis of a Multivariate Public Key Encryption Scheme with Internal Perturbation Structure
Information Security Applications
Constructing linear transformations of MPKC by generalized central symmetric matrices
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Kipnis-shamir attack on unbalanced oil-vinegar scheme
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Cryptanalysis of two quartic encryption schemes and one improved MFE scheme
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Security analysis of an improved MFE public key cryptosystem
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Multivariate public key cryptosystems from diophantine equations
Designs, Codes and Cryptography
Cryptanalysis of an improved MFE public key cryptosystem
International Journal of Security and Networks
Hi-index | 0.00 |
In the CT-track of the 2006 RSA conference, a new multivariate public key cryptosystem, which is called the Medium Field Equation (MFE) multivariate public key cryptosystem, is proposed by Wang, Yang, Hu and Lai. We use the second order linearization equation attack method by Patarin to break MFE. Given a ciphertext, we can derive the plaintext within 223 F216-multiplications, after performing once for any given public key a computation of complexity less than 252. We also propose a high order linearization equation (HOLE) attack on multivariate public key cryptosystems, which is a further generalization of the (first and second order) linearization equation (LE). This method can be used to attack extensions of the current MFE.