Decomposing attacks on asymmetric cryptography based on mapping compositions

Journal of Cryptology

Volumn 14, Issue 2, 2001, Pages 137-150

  Ye, Dingfeng ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Algebraic expression; Composition; Decomposition; Finite automaton; Public key cryptosystem; Quadratic function

Indexed keywords

EID: 0037907072     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-001-0001-z     Document Type: Article

References (18)

1. F. Bao and Y. Igarashi, Break finite automata public key cryptosystem, in Automata, Languages and Programming, Lecture Notes in Computer Sciences,Vol. 944, Springer-Verlag, Berlin, 1995, pp. 147-158.
2. E. Biham, Cryptanalysis of Patarin's 2-round public key system with S boxes, Proceedings of CRYPTO '99, Springer-Verlag, New York.
3. X.M. Chen, The Invertibility Theory and Application of Quadratic Finite Automata, Doctoral thesis, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing100080, November 1996.
4. D.W. Dai, K. Wu and H.G. Zhang, Cryptanalysis on a finite automaton public key cryptosystem, Sci. China,1994 (in Chinese).
5. Z.D. Dai and D.F. Ye, Weak invertibility of linear finite automata over commutative rings - classification and enumeration, Kexue Tongbao (Bulletin of Science),Vol. 4, No. 15 (1995), pp. 1357-1360 (in Chinese).
6. Z.D. Dai and D.F. Ye, Weak invertibility of linear finite automata I-classification and enumeration of transfer functions, Sci. China (Ser. A),Vol. 39, No. 6 (1996), pp. 613-623.
7. Z. Dai, D. Ye and K. Lam, Weak invertibility of finite automata and Cryptanalysis of FAPKC, Proceedings ofASIACRYPT '98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, Berlin, 1998.
8. M. Dickerson, The Functional Decomposition of Polynomials, Ph.D Thesis, TR89-1023, Deptartment of Computer Science, Cornell University, Ithaca, NY, July 1989.
9. W. Diffie and M.E. Hellman, New directions in cryptograghy, IEEE Trans. Inform. Theory, Vol. IT-22, No. 6 (1976), pp. 644-654.
10. J. Patarin, Cryptanalysis of the Matsumoto and Imai public key scheme of EUROCRYPT '88, Advances in Ciyptology, Proceedings ofCRYPTO '95, 1995, pp. 248-261.
11. J. Patarin and L. Goubin, Trapdoor one-way permutations and multivariate polynomials, Proceedings of ICICS '97, Lecture Notes in Computer Science, Vol. 1334, Springer-Verlag, Berlin, 1997.
12. J. Patarin and L. Goubin, Asymmetric cryptography with S-boxes, Proceedings of ICICS '97, Lecture Notes in Computer Science, Vol. 1334, Springer-Verlag, 1997.
13. J. Patarin, L. Goubin and N. Courtois, C_+ and HM: variations around two schemes of T. Matsumoto and H. Imai, Advances in Cryptology, Proceedings ofASIACRYPT '98, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, Berlin, 1998.
14. Z.P. Qin and H.G. Zhang, Cryptanalysis of finite automaton public key cryptosystems, Proceedings of Chinacrypt '96, Science Press, Beijing, pp. 75-86. (in Chinese).
15. R.J. Tao, On finite automaton one-key cryptosystem, in Fast Sofnvare Encryption, Lecture Notes in Computer Science,Vol. 809, Springer-Verlag, Berlin, 1993.
16. R.J. Tao and S.H. Chen, A finite automaton public key cryptosystem and digital signatures, Chinese J. Comput.,Vol. 8 1985, pp. 401-409 (in Chinese).
17. R.J. Tao and S.H. Chen, Two varieties of finite automaton public key cryptosystem and digital signatures, J. Comput. Sci. Tech.,Vol. 1 (1986), pp. 9-18.
18. D.F. Ye, Z.D. Dai and K.Y. Lam, Cryptanalysis of 2R schemes, Proceedings ofCRYPTO '99, Springer-Verlag, New York.