Abstract
We combine the method of searching for an invariant subspace of the unbalanced Oil and Vinegar signature scheme and the Minrank method to defeat the new TTS signature scheme, which was suggested for low-cost smart card applications at CHES 2004. We show that the attack complexity is less than 250.
Similar content being viewed by others
References
Chen, J., Moh, T.: On the Goubin-Courtois attack on TTM. Cryptol. ePrint Arch. 72(2001). http://eprint.iacr.org/2001/072
Chen, J., Yang, B., Peng, B.: Tame transformation signatures with topsy-yurvy hashes. In: IWAP'02, pp. 1–8 (2002). http://dsns.csie.nctu.edu.tw/iwap/proceedings/proceedings/sessionD/7.pdf
Chou, G., Guan, J., Chen, J.: A systematic construction of a q 2 k-model in TTM. Comm. Algebra 30, 551–562 (2002)
Coppersmith, D., Stern, J., Vaudenay, S.: The security of the birational permutation signature schemes. J. Cryptol. 10(3), 207–221 (1997)
Courtois, N., Goubin, L., Patarin, J.: Sflashv3, a fast asymmetric signature scheme (2003). http://eprint.iacr.org/2003/211
Ding, J.: A new variant of the Matsumoto-Imai cryptosystem through perturbation. In: Bao, F., Deng, R., Zhou, J. (eds.) Public Key Cryptosystems, PKC 2004, vol. 2947, pp. 305–318. LNCS. Springer, Berlin Heidelberg New York (2004)
Ding, J., Hodges, T.: Cryptanalysis of an implementation scheme of TTM. J. Algebra Appl. 3, 273–282 (2004). http://eprint.iacr.org/2003/084
Ding, J., Schmidt, D.: A common defect of the TTM cryptosystem. In: Proceedings of the Technical Track of the ACNS'03, pp. 68–78. ICISA Press (2003). http://eprint.iacr.org/2003/085
Ding, J., Schmidt, D.S.: The new TTM implementation is not secure. In: Niederreiter, H., Feng, K.Q., Xing, C.P. (eds.) Proceedings of International Workshop on Coding, Cryptography and Combinatorics (CCC 2003), pp. 106–121 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
Goubin, L., Courtois, N.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) Advances in Cryptology – ASIACRYPT 2000, International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 3–7, 2000, vol. 1976 of LNCS, pp. 44–57. Springer, Berlin Heidelberg New York (2000)
Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2–6, 1999, vol. 1592 of LNCS, pp. 206–222. Springer, Berlin Heidelberg New York (1999)
Kipnis, A., Shamir, A.: Cryptanalysis of the oil & vinegar signature scheme. In: Krawczyk, H. (ed.) Advances in Cryptology – CRYPTO'98: 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 1998, vol. 1462 of LNCS, pp. 257–267. Springer, Berlin Heidelberg New York (1998)
Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature verification and message encryption. In: Guenther, C.G. (ed.) Advances in Cryptology – EUROCRYPT '88, vol. 330 of LNCS, pp. 419–453. Springer, Berlin Heidelberg New York (1988)
Moh, T.T.: A fast public key system with signature and master key functions. Commun. Algebra 27, 2207–2222 (1999). http://www.usdsi.com/ttm.html
Patarin, J.: Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt'88. In: Coppersmith, D. (ed.) Advances in Cryptology – Crypto '95, vol. 963 of LNCS, pp. 248–261 (1995)
Patarin, J.: Hidden Field Equations (HFE) and Isomorphism of Polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) Eurocrypt'96, vol. 1070 of LNCS, pp. 33–48. Springer, Berlin Heidelberg New York (1996). Extended Version: http://www.minrank.org/hfe.pdf
Patarin, J., Courtois, N., Goubin, L.: Flash, a fast multivariate signature algorithm. In: Naccache, C. (ed.) Progress in Cryptology, CT-RSA, vol. 2020 of LNCS, pp. 298–307. Springer, Berlin Heidelberg New York (2001)
Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures http://www.minrank.org/quartz/. In: Naccache, C. (ed.) Progress in Cryptology, CT-RSA, vol. 2020 of LNCS, pp. 282–297. Springer, Berlin Heidelberg New York (2001)
Shamir, A.: Efficient signature schemes based on birational permutations. In: Stinson, D.R. (ed.) Advances in Cryptology – CRYPTO '93 (Santa Barbara, CA, 1993), vol. 1462 of LNCS, pp. 257–266. Springer, Berlin Heidelberg New York (1993)
Wolf, C., Preneel, B.: Large superfluous keys in multivariate quadratic asymmetric systems. In: Vaudenay, S. (ed.) Public Key Cryptography – PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23–26, 2005, vol. 3386 of LNCS, pp. 275–287. Springer, Berlin Heidelberg New York (2005)
Yang, B., Chen, J.: A more secure and efficacious TTS signature scheme. ICISC 2003 (2003). http://eprint.iacr.org/2003/160
Yang, B., Chen, J.: TTS: Rank attacks in tame-like multivariate PKCs. http://eprint.iacr.org/2004/061 (February 2004)
Yang, B., Chen, J., Chen, Y.: TTS: High-speed signatures on a low-cost smart card. In: Joye, M., Quisquater, J. (eds.) Cryptographic Hardware and Embedded Systems: CHES 2004, vol. 3156 of LNCS, pp. 371–385. Springer, Berlin Heidelberg New York (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ding, J., Schmidt, D. & Yin, Z. Cryptanalysis of the new TTS scheme in CHES 2004. Int. J. Inf. Secur. 5, 231–240 (2006). https://doi.org/10.1007/s10207-006-0003-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10207-006-0003-9