{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:47:16Z","timestamp":1773798436040,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642126772","type":"print"},{"value":"9783642126789","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12678-9_5","type":"book-chapter","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T11:28:35Z","timestamp":1272540515000},"page":"69-81","source":"Crossref","is-referenced-by-count":5,"title":["Flexible Partial Enlargement to Accelerate Gr\u00f6bner Basis Computation over $\\mathbb{F}_2$"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cabarcas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jintai","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Saied Emam","family":"Mohamed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Albrecht, M., Bard, G.: M4RI \u2013 linear algebra over GF(2) (2008), \n                    \n                      http:\/\/m4ri.sagemath.org\/index.html"},{"key":"5_CR2","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia (Italy), May 27-June 1 (2005)"},{"key":"5_CR3","unstructured":"Courtois, N.T.: Experimental algebraic cryptanalysis of block ciphers (2007), \n                    \n                      http:\/\/www.cryptosystem.net\/aes\/toyciphers.html"},{"key":"5_CR4","unstructured":"Ding, J.: Mutants and its impact on polynomial solving strategies and algorithms. Privately distributed research note, University of Cincinnati and Technical University of Darmstadt (2006)"},{"key":"5_CR5","unstructured":"Ding, J., Buchmann, J., Mohamed, M.S.E., Moahmed, W.S.A., Weinmann, R.-P.: MutantXL. In: Proceedings of the 1st international conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, April 2008, pp. 16\u201322. LMIB (2008)"},{"issue":"1-3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Pure and Applied Algebra"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Inscrypt 2008","author":"M. Gotaishi","year":"2009","unstructured":"Gotaishi, M., Tsujii, S.: Hxl -a variant of xl algorithm computing gr\u00f6bner bases. In: Yung, M., Liu, P., Lin, D. (eds.) Inscrypt 2008. LNCS, vol.\u00a05487, Springer, Heidelberg (2009)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"ICISC 2009","author":"M.S.E. Mohamed","year":"2009","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: ICISC 2009. LNCS. Springer, Heidelberg (2009) (accepted for publication)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-88403-3_14","volume-title":"Post-Quantum Cryptography","author":"M.S.E. Mohamed","year":"2008","unstructured":"Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: Solving polynomial equations over GF(2) using an improved mutant strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 203\u2013215. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12678-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:44:50Z","timestamp":1619783090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12678-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126772","9783642126789"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12678-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}