Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1070, Issue , 1996, Pages 33-48

  Patarin, Jacques ^a  

^a CP8 Transac ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; POLYNOMIALS; REPAIR; SET THEORY;

ASYMMETRIC ALGORITHMS; EXTENDED VERSIONS; HIDDEN FIELD EQUATIONS; ISOMORPHISM OF POLYNOMIALS; MULTIVARIATE POLYNOMIAL; SHORT MESSAGE; SHORT SIGNATURES; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84947932132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_4     Document Type: Conference Paper

References (15)

1. P. BLAKE, X. GAO, R. MULLIN, S. VANSTONE and T. YAGHOOBIAN,"Application of Finite Fields", Kluwer Academic Publishers.
2. G. BRASSARD,"A note on the complexity of cryptogrnphy", IEEE Tran. Inform. Theory, Vol. IT-25, pp. 232-233, 1979.
3. D. COPPERSMITH and S. WINOGRAD,"Matrix Multiplication via Arithmetic Progressions", J. Symbolic Computation, 1990, Vol. 9, pp. 251-280.
4. M. GAREY, D. JOHNSON,"Computers and intractability, A Guide to the Theory of NP-Completeness", FREEMAN.
5. R. LIDL, II. NIEDERREITER,"Finite Fields", Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press.
6. T. MATSUMOTO and H. IMAI,"Public Quadratic Polynomial-tuples for efficient signatui'e-verification and messagc-encryption", EUROCRYPT'88, Springer Verlag 1988, pp. 419-453.
7. m)", in Symbolic and Algebraic Computation, Lecture Notes in Computer Science, 358 (1989), pp. 259-270.
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.
9. J. PATARIN,"Cryptanalysis of the Matsumoto and Irnai Public Key Scheme of Eurocrypt'88", CR.YPTO'95, pp. 248-261.
10. l. J. PATARIN,"Asymmetric Cryptogrnphy urith a Hidden Monomial", available but not yet published paper.
11. B. SCHNEIER,"Applied Glyptography", John Wiley and Sons, first edition.
12. A. SHAMIR,"An efficient Identification Scheme Based on Permuted, Kernels," CRYPTO'89, pp. 606-609.
13. J. STERN,"A new identification scheme based on syndrome decoding", CRYP- TO'93, pp. 13-21.
14. m) ", IEEE Trans. Info. Th., 35 (1989), pp. 444-453.
15. J. VON ZLTR G ATHEN and V. SHOUP,"Computing Frobenius maps and factoring polynomial»", Proc. 24th Annual ACM Symp. Theory of Comput., ACM Press, 1992.