{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:41Z","timestamp":1725745301618},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319022963"},{"type":"electronic","value":"9783319022970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02297-0_33","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T07:37:38Z","timestamp":1376465858000},"page":"401-411","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic Attacks Using IP-Solvers"],"prefix":"10.1007","author":[{"given":"Ehsan","family":"Ullah","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Albrecht, M.: Algebraic attacks on the Courtois Toy Cipher. Diploma thesis, Universit\u00e4t Bremen (2006)"},{"key":"33_CR2","unstructured":"The ApCoCoA Team.: ApCoCoA: Approximate Computations in Commutative Algebra, \n                  \n                    http:\/\/www.apcocoa.org"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bard, G.V.: Algebraic cryptanalysis. Springer (2009)","DOI":"10.1007\/978-0-387-88757-9"},{"key":"33_CR4","unstructured":"Bard, G.V.: On the rapid solution of systems of polynomial equations over lowdegree extension fields of GF(2) via SAT-solvers. In: 8th Central European Conf. on Cryptography (2008)"},{"key":"33_CR5","unstructured":"Bard, G.V., Courtois, N.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(24) (2007)"},{"key":"33_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1993)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-10868-6_9","volume-title":"Cryptography and Coding","author":"J. Borghoff","year":"2009","unstructured":"Borghoff, J., Knudsen, L.R., Stolpe, M.: Bivium as a Mixed-Integer linear programming problem. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol.\u00a05921, pp. 133\u2013152. Springer, Heidelberg (2009)"},{"key":"33_CR8","unstructured":"Cameron, M., Chris Charnes, J.P.: An algebraic analysis of Trivium ciphers based on the Boolean Satisfiability problem, Cryptology ePrint Archive, Report 2007\/129 (2007), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Chen, B.: Strategies on algebraic attacks using SAT solvers. In: 9th Int. Conf. for Young Computer Scientists. IEEE Press (2008)","DOI":"10.1109\/ICYCS.2008.493"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11502760_10","volume-title":"Fast Software Encryption","author":"C. Cid","year":"2005","unstructured":"Cid, C., Murphy, S., Robshaw, M.: Small scale variants of the AES. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 145\u2013162. Springer, Heidelberg (2005)"},{"key":"33_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033036","volume-title":"Logic-based methods for optimization: combining optimization and constraint satisfaction","author":"J. Hooker","year":"2000","unstructured":"Hooker, J.: Logic-based methods for optimization: combining optimization and constraint satisfaction. John Wiley and Sons, Canada (2000)"},{"key":"33_CR12","unstructured":"ILOG CPLEX, \n                  \n                    http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"33_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1515\/gcc.2010.016","volume":"2","author":"P. Jovanovic","year":"2010","unstructured":"Jovanovic, P., Kreuzer, M.: Algebraic attacks using AST-Solvers. Groups - Complexity - Cryptology\u00a02, 247\u2013259 (2010)","journal-title":"Groups - Complexity - Cryptology"},{"key":"33_CR14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1515\/GCC.2009.231","volume":"1","author":"M. Kreuzer","year":"2009","unstructured":"Kreuzer, M.: Algebraic attacks galore! Groups - Complexity - Cryptology\u00a01, 231\u2013259 (2009)","journal-title":"Groups - Complexity - Cryptology"},{"key":"33_CR15","volume-title":"Commputational commutative algebra 1","author":"M. Kreuzer","year":"2000","unstructured":"Kreuzer, M., Robbiano, L.: Commputational commutative algebra 1. Springer, Heidelberg (2000)"},{"key":"33_CR16","volume-title":"Commputational commutative algebra 2","author":"M. Kreuzer","year":"2005","unstructured":"Kreuzer, M., Robbiano, L.: Commputational commutative algebra 2. Springer, Heidelberg (2005)"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1515\/JMC.2009.015","volume":"3","author":"M. Lamberger","year":"2009","unstructured":"Lamberger, M., Nad, T., Rijmen, V.: Numerical solvers in cryptanalysis. J. Math. Cryptology\u00a03, 249\u2013263 (2009)","journal-title":"J. Math. Cryptology"},{"key":"33_CR18","unstructured":"Limbeck, J.: Implementation und optimierung algebraischer angriffe. Diploma thesis, Universit\u00e4t Passau (2008)"},{"key":"33_CR19","unstructured":"Raddum, H.: Cryptanalytic results on Trivium. eSTREAM report 2006\/039 (2006), \n                  \n                    http:\/\/www.ecrypt.eu.org\/stream\/triviump3.html"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M. Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 244\u2013257. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02297-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:04:52Z","timestamp":1558008292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02297-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319022963","9783319022970"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02297-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}