{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:16:23Z","timestamp":1725848183473},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279978"},{"type":"electronic","value":"9783319279985"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27998-5_24","type":"book-chapter","created":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T06:08:51Z","timestamp":1454047731000},"page":"374-393","source":"Crossref","is-referenced-by-count":0,"title":["A Memory Efficient Variant of an Implementation of the F $$_4$$ Algorithm for Computing Gr\u00f6bner Bases"],"prefix":"10.1007","author":[{"given":"Yun-Ju","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Chih","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Mou","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiun-Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,30]]},"reference":[{"issue":"8","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1016\/j.jpaa.2008.11.043","volume":"213","author":"M Brickenstein","year":"2009","unstructured":"Brickenstein, M., Dreyer, A., Greuel, G.M., Wedler, M., Wienand, O.: New developments in the theory of Gr\u00f6bner bases and applications to formal verification. J. Pure Appl. Algebra 213(8), 1612\u20131635 (2009)","journal-title":"J. Pure Appl. Algebra"},{"key":"24_CR2","unstructured":"Buchberger, B.: An algorithm for finding the bases elements of the residue class ring modulo a zero dimensional polynomial ideal (German). Ph.D. thesis, Univ. of Innsbruck (1965)"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B Buchberger","year":"1970","unstructured":"Buchberger, B.: An algorithmical criterion for the solvability of algebraic systems (German). Aequationes Math. 4(3), 374\u2013383 (1970)","journal-title":"Aequationes Math."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner bases: an algorithmic method in polynomial ideal theory. In: Bose, N.K. (ed.) Multidimensional Systems Theory, chap. 6, pp. 184\u2013232. Reidel Publishing Company, Dodrecht (1985)","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-71209-1_48","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Condrat","year":"2007","unstructured":"Condrat, C., Kalla, P.: A Gr\u00f6bner basis approach to CNF-formulae preprocessing. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 618\u2013631. Springer, Heidelberg (2007)"},{"key":"24_CR6","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":"NT 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. 1807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"24_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms","author":"D Cox","year":"2007","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer, Heidelberg (2007)","edition":"3"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29011-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J-C Faug\u00e8re","year":"2012","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 27\u201344. Springer, Heidelberg (2012)"},{"issue":"1\u20133","key":"24_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F\n                    \n                      \n                    \n                    $$_4$$\n                  ). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F\n                    \n                      \n                    \n                    $$_5$$\n                  ). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. ACM, New York (2002)","DOI":"10.1145\/780506.780516"},{"key":"24_CR11","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. 2729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-41383-4_8","volume-title":"Advances in Information and Computer Security","author":"Y-J Huang","year":"2013","unstructured":"Huang, Y.-J., Petit, C., Shinohara, N., Takagi, T.: Improvement of Faug\u00e8re et al.\u2019s method to solve ECDLP. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 115\u2013132. Springer, Heidelberg (2013)"},{"issue":"3","key":"24_CR13","first-page":"643","volume":"1","author":"D Ikegami","year":"2003","unstructured":"Ikegami, D., Kaji, Y.: Maximum likelihood decoding for linear block codes using Gr\u00f6bner bases. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 1(3), 643\u2013651 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-19074-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"A Joux","year":"2011","unstructured":"Joux, A., Vitse, V.: A variant of the F4 algorithm. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 356\u2013375. Springer, Heidelberg (2011)"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TCSI.2007.914007","volume":"55","author":"Z Lin","year":"2008","unstructured":"Lin, Z., Xu, L., Bose, N.K.: A tutorial on Gr\u00f6bner bases with applications in signals and systems. IEEE Trans. Circ. Syst. 55(1), 445\u2013461 (2008)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"24_CR16","unstructured":"Merlet, J.P.: Polynomial systems. \n                    http:\/\/www-sop.inria.fr\/coprin\/logiciels\/ALIAS\/Benches\/node1.html"},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0747-7171(02)00131-1","volume":"35","author":"T Mora","year":"2003","unstructured":"Mora, T., Sala, M.: On the Gr\u00f6bner bases of some symmetric systems and their application to coding theory. J. Symbolic Comput. 35(2), 177\u2013194 (2003)","journal-title":"J. Symbolic Comput."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-34961-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"C Petit","year":"2012","unstructured":"Petit, C., Quisquater, J.-J.: On polynomial systems arising from a Weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 451\u2013466. Springer, Heidelberg (2012)"},{"issue":"6","key":"24_CR19","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/18.476246","volume":"41","author":"K Saints","year":"1995","unstructured":"Saints, K., Heegard, C.: Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Gr\u00f6bner bases. IEEE Trans. Inf. Theory 41(6), 1733\u20131751 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70545-1_45","volume-title":"Computer Aided Verification","author":"O Wienand","year":"2008","unstructured":"Wienand, O., Wedler, M., Stoffel, D., Kunz, W., Greuel, G.-M.: An algebraic approach for proving data correctness in arithmetic data paths. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 473\u2013486. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27998-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:12:59Z","timestamp":1559376779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27998-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279978","9783319279985"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27998-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}