{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:44:46Z","timestamp":1770745486933,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540244547","type":"print"},{"value":"9783540305804","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_17","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T15:51:09Z","timestamp":1278345069000},"page":"244-257","source":"Crossref","is-referenced-by-count":21,"title":["Tractable Rational Map Signature"],"prefix":"10.1007","author":[{"given":"Lih-Chung","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yuh-Hua","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Feipei","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Chun-Yen","family":"Chou","sequence":"additional","affiliation":[]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Ars, G., Fauge\u00e9re, J.-C.: Comparison of XL and Gr\u00f6bner Bases Algorithms over Finite Fields, preprint. Will appear as one half of an article at Asiacrypt 2004 and LNCS (2004)","DOI":"10.1007\/978-3-540-30539-2_24"},{"key":"17_CR2","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B.: Complexity of Gr\u00f6bner Basis Computations for Regular Overdetermined Systems, INRIA Rapport de Recherche No. 5049; a slightly modified preprint is accepted by the International Conference on Polynomial System Solving"},{"key":"17_CR3","unstructured":"Bardet, M., Faug\u00e9re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic Complexity of Gr\u00f6bner Basis Algorithms for Semi-regular Overdetermined Systems over Large Fields, manuscript in preparation"},{"key":"17_CR4","unstructured":"Chen, J.-M., Yang, B.-Y.: Tame Transformations Signatures With Topsy-Turvy Hashes. In: Proc. IWAP, Taipei (2002)"},{"key":"17_CR5","unstructured":"Chen, J.-M., Yang, B.-Y.: A More Secure and Efficacious TTS Scheme. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 320\u2013338. Springer, Heidelberg (2004); full version at eprint.iacr.org\/2003\/160"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-48329-2_37","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"D. Coppersmith","year":"1994","unstructured":"Coppersmith, D., Stern, J., Vaudenay, S.: Attacks on the birational permutation signature schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 435\u2013443. Springer, Heidelberg (1994)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45664-3_15","volume-title":"Public Key Cryptography","author":"N.T. Courtois","year":"2002","unstructured":"Courtois, N.T., Goubin, L., Meier, W., Tacier, J.-D.: Solving underdefined systems of multivariate quadratic equations. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 211\u2013227. Springer, Heidelberg (2002)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-36288-6_26","volume-title":"Public Key Cryptography - PKC 2003","author":"N. Courtois","year":"2002","unstructured":"Courtois, N.: Generic attacks and the security of quartz. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 351\u2013364. Springer, Heidelberg (2002)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Courtois, N.: Algebraic Attacks over GF(2k), Cryptanalysis of HFE Challenge 2 and SFLASH v2, accepted for PKC 2004 (2004)","DOI":"10.1007\/978-3-540-24632-9_15"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"N.T. Courtois","year":"2000","unstructured":"Courtois, N.T., Klimov, A.B., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-36563-X_10","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"N.T. Courtois","year":"2003","unstructured":"Courtois, N.T., Patarin, J.: About the XL algorithm over GF(2). In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 141\u2013157. Springer, Heidelberg (2003)"},{"key":"17_CR12","unstructured":"Courtois, N., Goubin, L., Patarin, J.: SFLASH v3, a Fast Asymmetric Signature Scheme, preprint"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30539-2_23","volume-title":"ASIACRYPT 2004","author":"C. Diem","year":"2004","unstructured":"Diem, C.: The XL-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 323\u2013337. Springer, Heidelberg (2004)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Trans. Info. Theory\u00a0IT-22(6), 644\u2013654","DOI":"10.1109\/TIT.1976.1055638"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases (F4). Journal of Pure and Applied Algebra\u00a0139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proc. ISSAC 2002","author":"J.-C. Faug\u00e9re","year":"2002","unstructured":"Faug\u00e9re, J.-C.: A New Efficient Algorithm for Computing Gr\u00f6bner Bases without Reduction to Zero (F5). In: Proc. ISSAC 2002, pp. 75\u201383. ACM Press, New York (2002)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.-C. Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gr\u00f6bner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"17_CR18","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-completeness, p. 251 (1979)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45325-3_31","volume-title":"Cryptography and Coding","author":"W. Geiselmann","year":"2001","unstructured":"Geiselmann, W., Steinwandt, R., Beth, T.: Attacking the affine parts of SFLASH. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, pp. 355\u2013359. Springer, Heidelberg (2001)"},{"key":"17_CR20","unstructured":"Geiselmann, W., Steinwandt, R., Beth, T.: Revealing the 441 Key Bits of SFLASH v2. In: Third NESSIE Workshop (2002)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"L. Goubin","year":"2000","unstructured":"Goubin, L., Courtois, N.T.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 44\u201357. Springer, Heidelberg (2000)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BFb0055733","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"A. Kipnis","year":"1998","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the oil & vinegar signature scheme. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 257\u2013266. Springer, Heidelberg (1998)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"A. Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 206\u2013222. Springer, Heidelberg (1999)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 419\u2013453. Springer, Heidelberg (1988)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1080\/00927879908826559","volume":"27","author":"T. Moh","year":"1999","unstructured":"Moh, T.: A Public Key System with Signature and Master Key Functions. Communications in Algebra\u00a027, 2207\u20132222 (1999)","journal-title":"Communications in Algebra"},{"key":"17_CR27","unstructured":"Moh, T., Chen, J.-M.: On the Goubin-Courtois Attack on TTM, published electronically by Cryptology ePrint Archive (2001\/072)"},{"key":"17_CR28","unstructured":"New European Schemes for Signatures, Integrity, and Encryption, project homepage at, http:\/\/www.cryptonessie.org"},{"key":"17_CR29","unstructured":"Performance of Optimized Implementations of the NESSIE primitives, version 2.0, http:\/\/www.cryptonessie.org"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-44750-4_20","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Patarin","year":"1995","unstructured":"Patarin, J.: Cryptanalysis of the matsumoto and imai public key scheme of eurocrypt \u201988. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 248\u2013261. Springer, Heidelberg (1995)"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J. Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"J. Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.T.: Improved algorithms for isomorphisms of polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998)"},{"key":"#cr-split#-17_CR33.1","doi-asserted-by":"crossref","unstructured":"Patarin, J., Courtois, N.T., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 282\u2013297. Springer, Heidelberg (2001);","DOI":"10.1007\/3-540-45353-9_21"},{"key":"#cr-split#-17_CR33.2","unstructured":"Updated version available at http:\/\/www.cryptonessie.org"},{"key":"#cr-split#-17_CR34.1","doi-asserted-by":"crossref","unstructured":"Patarin, J., Courtois, N.T., Goubin, L.: FLASH, a fast multivariate signature algorithm. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 298\u2013307. Springer, Heidelberg (2001);","DOI":"10.1007\/3-540-45353-9_22"},{"key":"#cr-split#-17_CR34.2","unstructured":"Updated version available at http:\/\/www.cryptonessie.org"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45146-4_1","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"A. Shamir","year":"2003","unstructured":"Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 1\u201326. Springer, Heidelberg (2003)"},{"key":"17_CR36","unstructured":"Wang, L.-C., Chang, F.-H.: Tractable Rational Map Cryptosystem, available at http:\/\/eprint.iacr.org\/2004\/046"},{"key":"17_CR37","unstructured":"Wolf, C.: Efficient Public Key Generation for Multivariate Cryptosystems, preprint, available at http:\/\/eprint.iacr.org\/2003\/089"},{"key":"17_CR38","unstructured":"Yang, B.-Y., Chen, J.-M.: Rank Attacks and Defence in Tame-Like Multivariate PKC\u2019s, see http:\/\/eprint.iacr.org\/2004\/061"},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11496618_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B.-Y. Yang","year":"2005","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL family: Theory and practice. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 67\u201386. Springer, Heidelberg (2005)"},{"key":"17_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-28632-5_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"B.-Y. Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Chen, Y.-H.: TTS: High-speed signatures on a low-cost smart card. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 371\u2013385. Springer, Heidelberg (2004)"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-30191-2_31","volume-title":"Information and Communications Security","author":"B.-Y. Yang","year":"2004","unstructured":"Yang, B.-Y., Chen, J.-M., Courtois, N.T.: On asymptotic security estimates in XL and gr\u00f6bner bases-related algebraic cryptanalysis. In: L\u00f3pez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol.\u00a03269, pp. 401\u2013413. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:24Z","timestamp":1605741864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}