{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:05:12Z","timestamp":1648548312008},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T00:00:00Z","timestamp":1386374400000},"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":[[2015,4]]},"DOI":"10.1007\/s10623-013-9899-z","type":"journal-article","created":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T03:02:05Z","timestamp":1386298925000},"page":"175-185","source":"Crossref","is-referenced-by-count":3,"title":["Speeding up deciphering by hypergraph ordering"],"prefix":"10.1007","volume":"75","author":[{"given":"Peter","family":"Horak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,7]]},"reference":[{"key":"9899_CR1","doi-asserted-by":"crossref","unstructured":"Bardet M., Faug\u00e8re J.C., Salvy B., Spaenlehauer P.J.: On the complexity of solving quadratic Boolean systems. J. Complex. 29, 53\u201375 (2013).","DOI":"10.1016\/j.jco.2012.07.001"},{"key":"9899_CR2","unstructured":"Courtois N., Pierzyk J.: Algebraic of block ciphers with over-defined systems of equations. Advances of Cryptology Asiacrypt. Lecture Notes in Computer Science, vol. 2501, pp. 267\u2013287 (2002)."},{"key":"9899_CR3","unstructured":"Pissanetzky S.: Sparse matrix technology, electronic edn (2007). http:\/\/www.scicontrols.com\/Publications\/BookSampleSMT.pdf . Accessed 3 Dec 2013"},{"key":"9899_CR4","doi-asserted-by":"crossref","unstructured":"Saad Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia, PA (2003).","DOI":"10.1137\/1.9780898718003"},{"key":"9899_CR5","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":"9899_CR6","unstructured":"Semaev I.: New combinatorial problem and evaluation of sparse equations over finite fields (in press)."},{"key":"9899_CR7","unstructured":"Tewarson R.P., Reginald P.: Sparse matrices (part of the mathematics in science and engineering series). Academic Press, New York (1973)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9899-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9899-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9899-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:37Z","timestamp":1559231917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9899-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9899"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9899-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,7]]}}}