{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T09:28:20Z","timestamp":1680686900413},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T00:00:00Z","timestamp":1478044800000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10623-016-0294-4","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T06:53:50Z","timestamp":1478069630000},"page":"129-144","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A combinatorial problem related to sparse systems of equations"],"prefix":"10.1007","volume":"85","author":[{"given":"Peter","family":"Horak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Semaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,2]]},"reference":[{"key":"294_CR1","unstructured":"Bardet M., Faug\u00e9re J.-C., Salvy B.: Complexity of Gr\u00f6bner Basis Computation for Semi-regular Overdetermined Sequences over \n                        $$F_2$$\n                        \n                            \n                                            \n                                \n                                    F\n                                    2\n                                \n                            \n                        \n                     with Solutions in \n                        $$F_2.$$\n                        \n                            \n                                            \n                                \n                                    \n                                        F\n                                        2\n                                    \n                                    .\n                                \n                            \n                        \n                     Research report RR-5049. INRIA (2003)."},{"key":"294_CR2","unstructured":"Bardet M., Faug\u00e9re J.-C., Salvy B., Yang B.-Y.: Asymptotic Behaviour of the Degree of Regularity of Semi-regular Polynomial Systems. In: MEGA 2005."},{"key":"294_CR3","doi-asserted-by":"crossref","unstructured":"Courtois N.T., Pieprzyk J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Advances of Cryptology\u2014ASIACRYPT 2002. Lecture Notes in Computer Science, vol. 2501, pp. 267\u2013287. Springer, Berlin (2002).","DOI":"10.1007\/3-540-36178-2_17"},{"key":"294_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10623-013-9899-z","volume":"75","author":"P Horak","year":"2015","unstructured":"Horak P., Tuza Zs: Speeding up deciphering by hypergraph ordering. Des. Codes Cryptogr. 75, 175\u2013185 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"294_CR5","first-page":"61","volume":"82","author":"K Iwama","year":"2004","unstructured":"Iwama K.: Worst-case upper bounds for kSAT. Bull. EATCS 82, 61\u201371 (2004).","journal-title":"Bull. EATCS"},{"key":"294_CR6","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1981","unstructured":"MacWilliams F.J., Sloan N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1981)."},{"key":"294_CR7","doi-asserted-by":"crossref","unstructured":"Raddum H.: MRHS equation systems. In: Adams C., et al. (eds.) 14th International Workshop on Selected Areas in Cryptography\u2014SAC \u201907. Lecture Notes in Computer Science, vol. 4876, pp. 232\u2013245. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-77360-3_15"},{"key":"294_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10623-008-9180-z","volume":"49","author":"H Raddum","year":"2008","unstructured":"Raddum H., Semaev I.: Solving multiple right-hand side equations. Des. Codes Cryptogr. 49, 147\u2013160 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"294_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10623-008-9182-x","volume":"49","author":"I Semaev","year":"2008","unstructured":"Semaev I.: On solving sparse algebraic equations over finite fields. Des. Codes Cryptogr. 49, 47\u201360 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"294_CR10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11786-013-0163-8","volume":"7","author":"I Semaev","year":"2013","unstructured":"Semaev I.: Improved Agreeing-Gluing algorithm. Math. Comput. Sci. 7, 321\u2013339 (2013).","journal-title":"Math. Comput. Sci."},{"key":"294_CR11","unstructured":"Semaev I.: New Results in the Linear Cryptanalysis of DES. Cryptology ePrint Archive, report 2014\/361."},{"key":"294_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10623-015-0058-6","volume":"79","author":"I Semaev","year":"2016","unstructured":"Semaev I.: MaxMinMax problem and sparse equations over finite fields. Des. Codes Cryptogr. 79, 383\u2013404 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"294_CR13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1515\/jmc-2013-5012","volume":"7","author":"P Zajac","year":"2013","unstructured":"Zajac P.: A new method to solve MRHS equation systems and its connection to group factorization. J. Math. Cryptol. 7, 367\u2013381 (2013).","journal-title":"J. Math. Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0294-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0294-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0294-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,5]],"date-time":"2017-08-05T10:13:20Z","timestamp":1501928000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0294-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0294-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,2]]}}}