{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T23:23:12Z","timestamp":1769037792053,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T00:00:00Z","timestamp":1206403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10623-008-9180-z","type":"journal-article","created":{"date-parts":[[2008,3,24]],"date-time":"2008-03-24T14:11:56Z","timestamp":1206367916000},"page":"147-160","source":"Crossref","is-referenced-by-count":25,"title":["Solving Multiple Right Hand Sides linear equations"],"prefix":"10.1007","volume":"49","author":[{"given":"H\u00e5vard","family":"Raddum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Semaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,25]]},"reference":[{"key":"9180_CR1","unstructured":"Bard G., Courtois N., Jefferson C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers. Cryptology ePrint Archive, 2007\/024, 25 January (2007)."},{"key":"9180_CR2","doi-asserted-by":"crossref","unstructured":"Cheon J.H., Lee D.H.: Resistance of S-Boxes against Algebraic Attacks. In: Fast Software Encryption 2004, LNCS 3017, pp. 83\u201394. Springer-Verlag (2004).","DOI":"10.1007\/978-3-540-25937-4_6"},{"key":"9180_CR3","unstructured":"Cid C., Murphy S., Robshaw M.: Small scale variants of the AES. In: FSE 2005, LNCS 3557, pp. 145\u2013162. Springer-Verlag (2005)."},{"key":"9180_CR4","unstructured":"Courtois N.: The security of hidden field equations (HFE). In: CT-RSA 2001, LNCS 2020, pp. 266\u2013281. Springer-Verlag (2001)."},{"key":"9180_CR5","doi-asserted-by":"crossref","unstructured":"Courtois N., Pieprzyk J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Asiacrypt 2002, LNCS 2501, pp. 267\u2013287. Springer-Verlag (2002).","DOI":"10.1007\/3-540-36178-2_17"},{"key":"9180_CR6","unstructured":"Courtois N., Meier W.: Algebraic attacks on stream ciphers with linear feedback. In: Eurocrypt 2003, LNCS 2656, pp. 345\u2013359. Springer-Verlag (2003)."},{"key":"9180_CR7","doi-asserted-by":"crossref","unstructured":"Daemen J., Rijmen V.: The design of rijndael; AES\u2014the advanced encryption standard. Springer-Verlag (2002).","DOI":"10.1007\/978-3-662-04722-4"},{"key":"9180_CR8","doi-asserted-by":"crossref","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). J. Pure Appl. Algebra 139, 61\u201388 (1999).","journal-title":"J. Pure Appl. Algebra"},{"key":"9180_CR9","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 ISSAC \u201902, pp. 75\u201383. ACM Press (2002).","DOI":"10.1145\/780506.780516"},{"key":"9180_CR10","unstructured":"Raddum H., Semaev I.: New technique for solving sparse equation systems, Ecrypt\u2019s STVL website, January 16th 2006, see also Cryptology ePrint Archive, 2006\/475 (2006)."},{"key":"9180_CR11","unstructured":"Raddum H., Semaev I.: Solving MRHS linear equations. Extended abstract. In: Proceedings of WCC\u201907, 16-20 Avril 2007, Versailles, France, INRIA, 323\u2013332, Full paper is accepted in Designs, Codes and Cryptography (2007)."},{"key":"9180_CR12","unstructured":"Shamir A., Patarin J., Courtois N., Klimov A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Eurocrypt 2000, LNCS 1807, pp. 392\u2013407. Springer-Verlag (2000)."},{"key":"9180_CR13","unstructured":"Zakrevskij A., Vasilkova I.: Reducing large systems of Boolean equations. In: 4th International Workshop on Boolean Problems, Freiberg University, September, 21\u201322 (2000)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9180-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9180-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9180-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:09Z","timestamp":1559245809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9180-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,25]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9180"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9180-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,25]]}}}