Garey M R, Johnson D S. Computers and intractability—a guide to the theory of NP-completeness[M]. New York: W H Freeman and Company, 1979: 250-251.
[2]
Jacques Patarin. Hiddenfields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms//Ueli Maurer, Ed. Advances in Cryptology- EUROCRYPT’1996. Lecture Notes in Computer Science. Spain: Springer-Verlag, 1996: 33-48.
[3]
Matsumoto T, Imai H. Public quadratic polynomial-tuples for efficient signature-verification and message-encryption//C. G. Günther, Ed. Advances in Cryptology-EUROCRYPT'88, Lecture Notes in Computer Science. New York: Springer-Verlag, 1988: 419-453.
[4]
Faugère, Jean-Charles, Antoine Joux. Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Grbner bases//Boneh D, Ed. Advances in Cryptology- CRYPTO’2003, Lecture Notes in Computer Science. California: Springer-Verlag, 2003: 44-60.
[5]
Aviad Kipnis, Adi Shamir. Cryptanalysis of the oil and vinegar signature scheme//Hugo Krawczyk, Ed. Advances in Cryptology- CRYPTO’1998, Lecture Notes in Computer Science. California: Springer-Verlag, 1998: 257-267.
[6]
Jintai Ding, Jason E Gower, Dieter S Schmidt. Multivariate public key cryptosystems[M]. New York: Springer-Verlag, 2005: 105-112.
[7]
Jintai Ding, Dieter S Schmidt. Cryptanalysis of HFEv and the internal perturbation of HFE//Serge Vaudenay, Ed. Public Key Cryptography - PKC 2005, Lecture Notes in Computer Science. Switzerland: Springer-Verlag, 2005: 288-301.
[8]
Vivien Dubois, Louis Granboulan, Jacques Stern. Cryptanalysis of HFE with internal perturbation//Tatsuaki Okamoto and Xiaoyun Wang, Eds. Public Key Cryptography-PKC’2007, Lecture Notes in Computer Science. Beijing: Springer-Verlag, 2007: 249-265.
