{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T09:27:27Z","timestamp":1680686847751},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,17]],"date-time":"2015-03-17T00:00:00Z","timestamp":1426550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10623-015-0058-6","type":"journal-article","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T07:26:25Z","timestamp":1426490785000},"page":"383-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["MaxMinMax problem and sparse equations over finite fields"],"prefix":"10.1007","volume":"79","author":[{"given":"Igor","family":"Semaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"58_CR1","unstructured":"Balakin G.V., Bachurin S.A.: Evaluation of the successive search for unknowns (in Russian). Trudy po diskretnoj matematike 6 7\u201313 Fizmatlit (2002)."},{"key":"58_CR2","unstructured":"Bard G.V., Courtois N.T., Jefferson C.: Efficients methods for conversion and solution of sparse systems of low-degree multivariate polynomials over $$GF(2)$$ G F ( 2 ) via SAT-solvers. Cryptology ePrint Archive: Report (2007\/024)."},{"key":"58_CR3","unstructured":"Bardet M., Faug\u00e9re J.-C., Salvy B.: Complexity of Gr\u00f6bner basis computation for semi-regular overdetermined sequences over $$F_2$$ F 2 with solutions in $$F_2$$ F 2 . Research Report RR-5049 INRIA (2003)."},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Buchberger B.: Theoretical basis for the reduction of polynomials to canonical forms. SIGSAM Bull. 39, 19\u201324 (1976).","DOI":"10.1145\/1088216.1088219"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Courtois N.T., Bard G.V.: Algebraic cryptanalysis of the data encryption standard. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, 4887, pp. 152\u2013169. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-77272-9_10"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Courtois N., Pieprzyk J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng, Y. (ed.) Asiacrypt 2002. LNCS, 2501, pp. 267\u2013287. Springer, Heidelberg (2002).","DOI":"10.1007\/3-540-36178-2_17"},{"key":"58_CR7","doi-asserted-by":"crossref","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, 1807, pp. 392\u2013407. Springer, Heidelberg (2000).","DOI":"10.1007\/3-540-45539-6_27"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Davis M., Logemann G., Loveland D.: A machine program for theorem proving. Commun. ACM 5, 394\u2013397 (1962).","DOI":"10.1145\/368273.368557"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Davis M., Putnam H.: A computing procedure for quantification theory. J. ACM 7, 201\u2013215 (1960).","DOI":"10.1145\/321033.321034"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Garcia F.D., de Koning Gans G., Muijrers R., van Rossum P., Verdult R., Schreur R.W., Jacobs B.: Dismantling MIFARE classics. In: Jajodia S., Lopez J. (eds.) ESORICS 2008. LNCS, 5283, pp. 97\u2013114. Springer, Heidelberg (2008).","DOI":"10.1007\/978-3-540-88313-5_7"},{"key":"58_CR11","unstructured":"E\u00e9n N., S\u00f6rensson N.: MiniSat home page. http:\/\/minisat.se\/ ."},{"key":"58_CR12","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.C.: A new efficient algorithm for computing Gr\u00f6bner bases. J. Pure Appl. Algebr. 139, 61\u201368 (1999).","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Wan P.S. (ed.) ISSAC 2002, pp. 75\u201383. ACM Press, New York (2002).","DOI":"10.1145\/780506.780516"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Horak P., Tuza Z.: Speeding up deciphering by hypergraph ordering. Des. Codes Cryptogr. 75, 175\u2013185 (2013). doi: 10.1007\/s10623-013-9899-z .","DOI":"10.1007\/s10623-013-9899-z"},{"key":"58_CR15","unstructured":"Iwama K., Seto K., Takai T., Tamaki S.: Improved randomised algorithms for 3-SAT. ISAAC 2010, Part I. LNCS, 6506, pp. 73\u201384. Springer, Heidelberg (2010)."},{"key":"58_CR16","unstructured":"Lazard D.: Gr\u00f6bner-bases, Gaussian elimination and resolution of systems of algebraic equations. EUROCAL, pp. 146\u2013156. Springer, New York (1983)."},{"key":"58_CR17","unstructured":"Prachar K.: Primzahlverteilung. Springer, Berlin (1957)."},{"key":"58_CR18","unstructured":"Raddum H.: Solving non-linear sparse equation systems over $$GF(2)$$ G F ( 2 ) using graphs. University of Bergen, preprint (2004)."},{"key":"58_CR19","unstructured":"Raddum H., Semaev I.: Solving multiple right hand sides linear equations. Des. Codes Cryptogr. 49, pp. 147\u2013160 (2008), In: Extended Abstract in Proceedings of WCC\u201907, 16\u201320 April 2007, Versailles, France, INRIA (2007)."},{"key":"58_CR20","doi-asserted-by":"crossref","unstructured":"Semaev I.: On solving sparse algebraic equations over finite fields. Des. Codes Cryptogr. 49, 47\u201360 (2008).","DOI":"10.1007\/s10623-008-9182-x"},{"key":"58_CR21","doi-asserted-by":"crossref","unstructured":"Semaev I.: Sparse algebraic equations over finite fields. SIAM J. Comput. 39, 388\u2013409 (2009).","DOI":"10.1137\/070700371"},{"key":"58_CR22","doi-asserted-by":"crossref","unstructured":"Semaev I.: Improved agreeing-gluing algorithm. Math. Comput. Sci. 7, 321\u2013339 (2013).","DOI":"10.1007\/s11786-013-0163-8"},{"key":"58_CR23","unstructured":"Yang B.Y., Chen J.M., Courtois N.: n asymptotic security estimates in XL and Gr\u00f6bner bases-related algebraic cryptanalysis. LNCS, 3269, pp. 401\u2013413. Springer, Heidelberg (2004)."},{"key":"58_CR24","unstructured":"Zakrevskij A., Vasilkova I.: Reducing large systems of Boolean equations. In: 4th International Workshop on Boolean Problems. Freiberg University, 21\u201322 Sep (2000)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0058-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0058-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0058-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:39Z","timestamp":1559246319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0058-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,17]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0058-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,17]]}}}