Building secure tame-like multivariate public-key cryptosystems: The new TTS

Lecture Notes in Computer Science

Volumn 3574, Issue , 2005, Pages 518-531

  Yang, Bo Yin ^a   Chen, Jiun Ming ^b  

^a TAMKANG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; POLYNOMIALS; SECURITY OF DATA;

MULTIVARIATE PUBLIC-KEY CRYPTOSYSTEMS; OIL-AND-VINEGAR; RANK-BASED ATTACKS; TRIANGULAR IDEAS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 26444593242     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506157_43     Document Type: Conference Paper

References (35)

1. M. Bardet, J.-C. Faugère, B. Salvy, and B.-Y. Yang, Asymptotic Expansion of the Degree of Regularity for Semi-Regular Systems of Equations, to be presented MEGA'05.
2. A. Braeken, C. Wolf and B. Preneel, A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes, CT-RSA'05, LNCS 3376, pp. 29-43.
3. J.-M. Chen and B.-Y. Yang, A More Secure and Efficacious TTS Scheme, ICISC'03, LNCS 2971, pp. 320-338.
4. C.-Y. Chou, Y.-H. Hu, F.-P. Lai, L.-C. Wang, and B.-Y. Yang, Tractable Rational Map Signature, PKC'05, LNCS 3386, pp. 244-257.
5. D. Coppersmith, J. Stern, and S. Vaudenay, Attacks on the Birational Permutation Signature Schemes, Crypto'93, LNCS 773, pp. 435-443.
6. N. Courtois, L. Goubin, W. Meier, and J. Tacier, Solving Underdefined Systems of Multivariate Quadratic Equations, PKC'02, LNCS 2274, pp. 211-227.
7. N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Eurocrypt'00, LNCS 1807, pp. 392-407.
8. C. Diem, The XL-algorithm and a conjecture from commutative algebra, Asiacrypt'04, LNCS 3329, pp. 338-353.
9. J. Ding and D. Schmidt, Rainbow, a new multivariate polynomial signature system, to appear at ACNS'05.
10. J. Ding and D. Schmidt, Cryptanalysis of HFEv and Internal Perturbation of HFE, PKC'05, LNCS 3386, pp. 288-301.
11. J. Ding and Z. Yin, Cryptanalysis of TTS and Tame-like Multivariable Signature Schemes, presentation at IWAP'04.
12. J.-C. Faugère, A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero (F5), Proceedings of ISSAC, ACM Press, 2002.
13. J.-C. Faugère and A. Joux, Algebraic Cryptanalysis of Hidden Field Equations (HFE) Cryptosystems Using Gröbner Bases, Crypto 2003, LNCS 2729, pp. 44-60.
14. M. Feldhofer, S. Dominikus, and J. Wolkerstorfer, Strong Authentication for RFID Systems Using the AES Algorithm, CHES '04, LNCS 3156, pp. 357-370.
15. M. Garey and D. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman and Co., 1979, p. 251.
16. L. Goubin and N. Courtois, Cryptanalysis of the TTM Cryptosystem, Asiacrypt'00, LNCS 1976, pp. 44-57.
17. L. K. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th Annual ACM Symposium on the Theory of Computing, (May '96) pp. 212-220.
18. A. Joux, S. Kunz-Jacques, F. Muller, P.-M. Ricordel, Cryptanalysis of the Tractable Rational Map Cryptosystem, PKC'05, LNCS 3386, pp. 258-274.
19. A. Kipnis, J. Patarin, and L. Goubin, Unbalanced Oil and Vinegar Signature Schemes, Crypto'99, LNCS 1592, pp. 206-222.
20. A. Kipnis and A. Shamir, Cryptanalysis of the Oil and Vinegar Signature Scheme, Crypto'98, LNCS 1462, pp. 257-266.
21. A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem, Crypto'99, LNCS 1666, pp. 19-30.
22. T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Eurocrypt'88, LNCS 330, pp. 419-453.
23. T. Moh, A Public Key System with Signature and Master Key Functions, Communications in Algebra, 27 (1999), pp. 2207-2222.
24. NESSIE project, www.cryptonessie.org.
25. J. Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88, Crypto'95, LNCS 963, pp. 248-261.
26. J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Eurocrypt'96, LNCS 1070, pp. 33-48.
27. J. Patarin, N. Courtois, and L. Goubin, FLASH, a Fast Multivariate Signature Algorithm, CT-RSA'Ol, LNCS 2020, pp. 298-307. Update at [24].
28. P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, Proc. 35th Ann. Symp. on Foundations of Comp. Sci., IEEE Comp. Soc. Press (1994), pp. 124-134.
29. L. Wang, Tractable Rational Map Cryptosystem, see ePrint 2004/046.
30. E. Weisstein, RSA-576 Factored, mathworld.wolfram.com/news/2003-12-05/rsa
31. C. Wolf, Efficient Public Key Generation for Multivariate Cryptosystems, Int'l Workshop on Cryptographic Algorithms and their Uses 2004, pp. 78-93, also ePrint 2003/089.
32. C. Wolf, A. Braeken, and B. Preneel, Efficient Cryptanalysis of RSE(2)PKC and RSSE(2)PKC, SCN '04, LNCS 3352, pp. 294-309.
33. C. Wolf and B. Preneel, Taxonomy of Public-Key Schemes based on the Problem of Multivariate Quadratic Equations, ePrint 2005/077.
34. B.-Y. Yang and J.-M. Chen, All in the XL Family: Theory and Practice, ICISC'04, LNCS 3506, pp. 67-86.
35. B.-Y. Yang, J.-M. Chen, and Y.-H. Chen, TTS: High-Speed Signatures from Low-End Smartcards, CHES '04, LNCS 3156, pp. 371-385.