{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:11:00Z","timestamp":1649077860794},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T00:00:00Z","timestamp":1460073600000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s11432-016-5548-2","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T11:36:19Z","timestamp":1460633779000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Boolean equation systems and applications in cryptanalysis"],"prefix":"10.1007","volume":"59","author":[{"given":"Xiaoshan","family":"Gao","sequence":"first","affiliation":[]},{"given":"Zhenyu","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"key":"5548_CR1","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad J. Some optimal inapproximability results. J ACM, 2001; 48: 798\u2013859","journal-title":"J ACM"},{"key":"5548_CR2","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1016\/j.tcs.2009.02.003","volume":"410","author":"S Zhao","year":"2009","unstructured":"Zhao S, Gao X S. Minimal achievable approximation ratio for MAX-MQ in finite fields. Theor Comput Sci, 2009; 410: 2285\u20132290","journal-title":"Theor Comput Sci"},{"key":"5548_CR3","first-page":"75","volume-title":"In: Proceedings of International Symposium on Symbolic & Algebraic Computation (ISSAC), Lille","author":"J C Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re J C. A new efficient algorithm for computing Gr\u00a8oner bases without reduction to zero (F5). In: Proceedings of International Symposium on Symbolic & Algebraic Computation (ISSAC), Lille, 2002. 75\u201383"},{"key":"5548_CR4","first-page":"392","volume-title":"In: Advances in Cryptology\u2013EUROCRYPT. Berlin: Springer","author":"N Courtois","year":"2000","unstructured":"Courtois N, Klimov A, Patarin J, et al. Efficient algorithms for solving over-determined systems of multivariate polynomial equations. In: Advances in Cryptology\u2013EUROCRYPT. Berlin: Springer, 2000. 392\u2013407"},{"key":"5548_CR5","volume-title":"Cryptology ePrint Archive Report 2007\/040","author":"C Mcdonald","year":"2007","unstructured":"Mcdonald C, Chernes C, Pieprzyk J. Attacking Bivium With MiniSat. Cryptology ePrint Archive Report 2007\/040. 2007"},{"key":"5548_CR6","first-page":"203","volume-title":"In: Cryptographic Hardware and Embedded Systems","author":"C Bouillaguet","year":"2010","unstructured":"Bouillaguet C, Chen H C, Cheng C M, et al. Fast exhaustive search for polynomial systems in F2. In: Cryptographic Hardware and Embedded Systems. Berlin: Springer, 2010. 203\u2013218"},{"key":"5548_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.jco.2012.07.001","volume":"29","author":"M Bardet","year":"2013","unstructured":"Bardet M, Faug\u00e9re J C, Salvy B, et al. On the complexity of solving quadratic boolean systems. J Complex, 2013; 29: 53\u201375","journal-title":"J Complex"},{"key":"5548_CR8","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.jsc.2011.12.025","volume":"47","author":"X S Gao","year":"2012","unstructured":"Gao X S, Huang Z. Characteristic set algorithms for equation solving in finite fields. J Symb Comput, 2012; 47: 655\u2013679","journal-title":"J Symb Comput"},{"key":"5548_CR9","volume-title":"ArXiv:1405.4596","author":"Z Y Huang","year":"2014","unstructured":"Huang Z Y, Sun Y, Lin D D. On the efficiency of solving boolean polynomial systems with the characteristic set method. ArXiv:1405.4596, 2014"},{"key":"5548_CR10","first-page":"16","volume-title":"In: Selected Areas in Cryptography","author":"Z Y Huang","year":"2012","unstructured":"Huang Z Y, Lin D D. A new method for solving polynomial systems with noise over F2 and its applications in cold boot key recovery. In: Selected Areas in Cryptography. Berlin: Springer, 2012. 16\u201333"},{"key":"5548_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-21554-4_4","volume-title":"In: Applied Cryptography and Network Security. Berlin: Springer","author":"M Albrecht","year":"2011","unstructured":"Albrecht M, Cid C. Cold boot key recovery by solving polynomial systems with noise. In: Applied Cryptography and Network Security. Berlin: Springer, 2011. 57\u201372"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5548-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-016-5548-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5548-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:41:08Z","timestamp":1559403668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-016-5548-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,8]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["5548"],"URL":"https:\/\/doi.org\/10.1007\/s11432-016-5548-2","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,8]]},"article-number":"050104"}}