{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:36:53Z","timestamp":1743093413448,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319579719"},{"type":"electronic","value":"9783319579726"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57972-6_9","type":"book-chapter","created":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T01:54:05Z","timestamp":1493344445000},"page":"116-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Implementation of Boolean Gr\u00f6bner Basis Computation"],"prefix":"10.1007","author":[{"given":"Rodrigo Alexander","family":"Castro Campos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feli\u00fa Davino","family":"Sagols Troncoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco Javier","family":"Zaragoza Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,29]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jco.2012.07.001","volume":"29","author":"M Bardet","year":"2013","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B., Spaenlehauer, P.J.: On the complexity of solving quadratic Boolean systems. J. Complex. 29(1), 53\u201375 (2013)","journal-title":"J. Complex."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1215\/S0012-7094-87-05517-7","volume":"55","author":"D Bayer","year":"1987","unstructured":"Bayer, D., Stillman, M.: A theorem on refining division orders by the reverse lexicographic order. Duke Math. J. 55(2), 321\u2013328 (1987)","journal-title":"Duke Math. J."},{"key":"9_CR3","unstructured":"Bosma, W., Cannon, J., Playoust, C.: Magma calculator (2016). http:\/\/magma.maths.usyd.edu.au\/calc\/"},{"key":"9_CR4","unstructured":"Bosma, W., Cannon, J., Playoust, C.: Magma computer algebra documentation (2016). https:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/text\/1207"},{"issue":"9","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.jsc.2008.02.017","volume":"44","author":"M Brickenstein","year":"2009","unstructured":"Brickenstein, M., Dreyer, A.: PolyBori: a framework for Gr\u00f6bner basis computations with Boolean polynomials. J. Symb. Comput. 44(9), 1326\u20131345 (2009). Effective Methods in Algebraic Geometry","journal-title":"J. Symb. Comput."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal. Ph.D. thesis (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume-title":"Symbolic and Algebraic Computation","author":"B Buchberger","year":"1979","unstructured":"Buchberger, B.: A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner-bases. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 3\u201321. Springer, Heidelberg (1979). doi: 10.1007\/3-540-09519-5_52"},{"key":"9_CR8","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 \u2014 EUROCRYPT 2000","author":"N Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., 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). doi: 10.1007\/3-540-45539-6_27"},{"key":"9_CR9","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"DA Cox","year":"2007","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics, 3rd edn. Springer, New York (2007)","edition":"3"},{"key":"9_CR10","unstructured":"Developers, T.S.: SageMath, the Sage Mathematics Software System (2016). http:\/\/www.sagemath.org"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jsc.2013.08.001","volume":"59","author":"C Eder","year":"2013","unstructured":"Eder, C.: An analysis of inhomogeneous signature-based Gr\u00f6bner basis computations. J. Symb. Comput. 59, 21\u201335 (2013)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"issue":"1\u20133","key":"9_CR13","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 (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, NY, USA, pp. 75\u201383. ACM, New York (2002)","DOI":"10.1145\/780506.780516"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15582-6_17","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C.: FGb: a library for Computing Gr\u00f6bner bases. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 84\u201387. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15582-6_17"},{"key":"9_CR16","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). doi: 10.1007\/978-3-540-45146-4_3"},{"key":"9_CR17","unstructured":"Fayssal, M.: Faug\u00e9re-Lachartre Parallel Gaussian Elimination for Gr\u00f6bner Bases Computations Over Finite Fields. Master\u2019s thesis, Pierre and Marie Curie University (2012)"},{"issue":"2\u20133","key":"9_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0747-7171(88)80048-8","volume":"6","author":"R Gebauer","year":"1988","unstructured":"Gebauer, R., M\u00f6ller, H.M.: On an installation of Buchberger\u2019s algorithm. J. Symb. Comput. 6(2\u20133), 275\u2013286 (1988)","journal-title":"J. Symb. Comput."},{"key":"9_CR19","unstructured":"Grayson, D.R., Stillman, M.E.: Macaulay2, a software system for research in algebraic geometry. http:\/\/www.math.uiuc.edu\/Macaulay2\/"},{"key":"9_CR20","unstructured":"Herrera Garc\u00eda, J.L.J.: Autenticaci\u00f3n y Cifrado Basado en Ecuaciones Cuadr\u00e1ticas de Varias Variables. Ph.D. thesis, Instituto Polit\u00e9cnico Nacional (2015)"},{"key":"9_CR21","unstructured":"Hinkelmann, F., Arnold, E.: Fast Gr\u00f6bner basis computation for boolean polynomials. CoRR (2010)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-14423-3_7","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"MSE Mohamed","year":"2010","unstructured":"Mohamed, M.S.E., Cabarcas, D., Ding, J., Buchmann, J., Bulygin, S.: MXL3: an efficient algorithm for computing Gr\u00f6bner bases of zero-dimensional ideals. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 87\u2013100. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14423-3_7"},{"key":"9_CR23","unstructured":"Nguyen, T.H.: Combinations of Boolean Gr\u00f6bner Bases and SAT Solvers. Ph.D. thesis, University of Kaiserslautern (2014)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","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. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). doi: 10.1007\/3-540-68339-9_4"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Roune, B.H., Stillman, M.: Practical Gr\u00f6bner basis computation. In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC 2012, NY, USA, pp. 203\u2013210. ACM, New York (2012)","DOI":"10.1145\/2442829.2442860"},{"key":"9_CR26","unstructured":"Steel, A.: A dense variant of the F4 Gr\u00f6bner basis algorithm (2013). http:\/\/magma.maths.usyd.edu.au\/~allan\/densef4\/"}],"container-title":["Communications in Computer and Information Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57972-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T09:39:21Z","timestamp":1692783561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57972-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319579719","9783319579726"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57972-6_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"29 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CARLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American High Performance Computing Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"carla2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/carla2017.ccarla.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}