Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1070)


In [6] T. Matsumoto and H. Imai described a new asymmet- ric algorithm based on multivariate polynomials of degree two over a finite field, which was subsequently broken in [9]. Here we present two new families of Asymmetric Algorithms that so far have resisted all at- tacks, if properly used: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP). These algorithms can be seen as two candidate ways to repair the Matsumoto-Imai Algorithm. HFE can be used to do sig- natures, encryption or authentication in an asymmetric way, with very short signatures and short encryptions of short messages. IP can be used for signatures and for zero knowledge authentication.

An extended version of this paper can be obtained from the author. Another way to repair the Matsumoto-Imai Algorithm will be presented in [10].


Finite Field Authentication Scheme Affine Transformation Asymmetric Cryptography Hide Field Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    F. BLAKE, X. GAO, R. MULLIN, S. VANSTONE and T. YAGHOOBIAN, “Application of Finite Fields”, Kluwer Academic Publishers.Google Scholar
  2. 2.
    G. BRASSARD, “A note on the complexity of cryptography”, IEEE Tran. Inform. Theory, Vol. IT-25, pp. 232–233, 1979.CrossRefMathSciNetGoogle Scholar
  3. 3.
    D. COPPERSMITH and S. WINOGRAD, “Matrix Multiplication via Arithmetic Progressions”, J. Symbolic Computation, 1990, Vol. 9, pp. 251–280.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    M. GAREY, D. JOHNSON, “Computers and intractability, A Guide to the Theory of N P-Completeness”, FREEMAN.Google Scholar
  5. 5.
    R. LIDL, H. NIEDERREITER, “Finite Fields”, Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press.Google Scholar
  6. 6.
    T. MATSUMOTO and H. IMAI, “Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption”, EUROCRYPT’88, Springer Verlag 1988, pp. 419–453.Google Scholar
  7. 7.
    A. MENEZES, P. VAN OORSCHOT ans S. VANSTONE, “Some computational aspects of root finding in GF(q m)”, in Symbolic and Algebraic Computation, Lecture Notes in Computer Science, 358 (1989), pp. 259–270.Google Scholar
  8. 8.
    Gary L. MULLEN, “Permutation Polynomials over Finite Fields”, in “Finite Fields, Coding Theory, and Advances in Communications and Computing”, Dekker, Volume 141, 1993, pp. 131–152.Google Scholar
  9. 9.
    J. PATARIN, “Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88”, CRYPTO’95, pp. 248–261.Google Scholar
  10. 10.
    J. PATARIN, “Asymmetric Cryptography with a Hidden Monomial”, available but not yet published paper.Google Scholar
  11. 11.
    B. SCHNEIER, “Applied Cryptography”, John Wiley and Sons, first edition.Google Scholar
  12. 12.
    A. SHAMIR, “An efficient Identification Scheme Based on Permuted Kernels”, CRYPTO’89, pp. 606–609.Google Scholar
  13. 13.
    J. STERN, “A new identification scheme based on syndrome decoding”, CRYPTO’93, pp. 13–21.Google Scholar
  14. 14.
    P. VAN OORSCHOT and S. VANSTONE, “A geometric approach to root finding in GF(q m),” IEEE Trans. Info. Th., 35 (1989), pp. 444–453.CrossRefzbMATHGoogle Scholar
  15. 15.
    J. VON ZUR GATHEN and V. SHOUP, “Computing Frobenius maps and factoring polynomials”, Proc. 24th Annual ACM Symp. Theory of Comput., ACM Press, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  1. 1.CP8 TransacLouveciennes CedexFrance

Personalised recommendations