1. 1) A.S. Fraenkel and Y. Yesha, Complexity of problems in games, graphs and algebraic equations, Discrete Appl. Math., 1 (1979), 15-30.
2. 2) M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, New York, 1979.
3. 3) J. Patarin, The Oil and Vinegar Signature Scheme, in: the Dagstuhl Workshop on Cryptography, 1997.
4. 4) A. Kipnis, J. Patarin and L. Goubin, Unbalanced oil and vinegar signature schemes, in: in: Proc. of EUROCRYPT'99, J. Stern ed., LNCS, Vol. 1592, pp. 206-222, Springer, Berlin, Heidelberg, 1999,extended in \url{http://www.goubin.fr/papers/OILLONG.PDF}, 2003.
5. 5) J. Ding and D. Schmidt, Rainbow, a new multivariate polynomial signature scheme, in: in: Proc. of ACNS 2005, J. Ioannidis et al., LNCS, Vol. 3531, pp. 164-175, Springer, Berlin, Heidelberg, 2005.