Cryptanalysis of “2R” schemes

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

Volumn 1666, Issue , 1999, Pages 315-325

  Ding Feng, Ye ^a   Kwok Yan, Lam ^b   Zong Duo, Dai ^c  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING; PUBLIC KEY CRYPTOGRAPHY;

ALGEBRAIC EXPRESSION; COMPUTER EXPERIMENT; FINITE FIELDS; FUNCTION DECOMPOSITION; PUBLIC KEYS; QUADRATIC MAPPING;

HEURISTIC METHODS;

EID: 79959853957     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48405-1_20     Document Type: Conference Paper

References (13)

1. M. Dickerson, The Functional Decomposition of Polynomials, Ph.D Thesis, TR89-1023, Dept. of Computer Science, Cornell University, Ithaca, NY, July 1989.
2. W. Die and M. E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, IT-22(6) 644-654, 1976.
3. T. Elgamal, A Public Key Cryptosystem and a Signature Schemes Based on Discrete Logarithms, IEEE Trans. Inform. Theory, Vol. IT-31(1985), 469-472.
4. T. Matsumoto and H. Imai, Algebraic Methods for Constructing Asymmetric Cryptosystems, AAECC-3, Grenoble, 1985.
5. T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Ecient Signature-Verication and Message-Encryption, Advances in Cryptology, Proceedings of EUROCRYPT'88, Springer Verlag, pp 419-453.
6. W.B. Muller, Polynomial Functions in Modern Cryptology, Contributions to General Algebra 3: Proceedings of the Vienna Conference, Vienna: Verlag HolderPicher-Tempsky, 1985, pp. 7-32.
7. J. Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypto'88, Advances in Cryptology, Proceedings of CRYPTO'95, Springer Verlag, pp 248-261.
8. J. Patarin, Asymmetric Cryptography with a Hidden Monomial, Advances in Cryptology, Proceedings of CRYPTO'96, Springer Verlag, pp 45-60.
9. J. Patarin, Hidden Fields Equations and Isomorphisms of Polynomials: Two New Families of Asymmetric Algorithms, Advances in Cryptology, Proceedings of EUROCRYPT'96, Springer Verlag, pp 33-48.
10. J. Patarin and L. Goubin, Trapdoor one-way permutations and multivariate polynomials, Proceedings of ICICS'97, Lecture Notes in Computer Science, Vol. 1334, Springer, 1997.
11. J. Patarin and L. Goubin, Asymmetric cryptography with S-boxes, Proceedings of ICICS'97, Lecture Notes in Computer Science, Vol. 1334, Springer, 1997.
12. J. Patarin and L. Goubin, C*-+ and HM: Variations Around Two Schemes of T.Matsumoto and H. Imai, Advances in Cryptology, Proceedings of ASIACRYPT'98, Lecture Notes in Computer Science 1514, Springer Verlag, pp 35-49.
13. R.L. Rivest, A. Shamir, L.M. Adleman, A Method for Obtaining Digital Signaturesand Public-Key Cryptosystems, Communications of ACM, v.21, n.2, 1978, pp.120-126.