Abstract
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].
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
F. BLAKE, X. GAO, R. MULLIN, S. VANSTONE and T. YAGHOOBIAN, “Application of Finite Fields”, Kluwer Academic Publishers.
G. BRASSARD, “A note on the complexity of cryptography”, IEEE Tran. Inform. Theory, Vol. IT-25, pp. 232–233, 1979.
D. COPPERSMITH and S. WINOGRAD, “Matrix Multiplication via Arithmetic Progressions”, J. Symbolic Computation, 1990, Vol. 9, pp. 251–280.
M. GAREY, D. JOHNSON, “Computers and intractability, A Guide to the Theory of N P-Completeness”, FREEMAN.
R. LIDL, H. NIEDERREITER, “Finite Fields”, Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press.
T. MATSUMOTO and H. IMAI, “Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption”, EUROCRYPT’88, Springer Verlag 1988, pp. 419–453.
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.
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.
J. PATARIN, “Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88”, CRYPTO’95, pp. 248–261.
J. PATARIN, “Asymmetric Cryptography with a Hidden Monomial”, available but not yet published paper.
B. SCHNEIER, “Applied Cryptography”, John Wiley and Sons, first edition.
A. SHAMIR, “An efficient Identification Scheme Based on Permuted Kernels”, CRYPTO’89, pp. 606–609.
J. STERN, “A new identification scheme based on syndrome decoding”, CRYPTO’93, pp. 13–21.
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.
J. VON ZUR GATHEN and V. SHOUP, “Computing Frobenius maps and factoring polynomials”, Proc. 24th Annual ACM Symp. Theory of Comput., ACM Press, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patarin, J. (1996). Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U. (eds) Advances in Cryptology — EUROCRYPT ’96. EUROCRYPT 1996. Lecture Notes in Computer Science, vol 1070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68339-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-68339-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61186-8
Online ISBN: 978-3-540-68339-1
eBook Packages: Springer Book Archive