{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:33:15Z","timestamp":1725600795741},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231407"},{"type":"electronic","value":"9783642231414"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23141-4_7","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:36:48Z","timestamp":1313570208000},"page":"62-71","source":"Crossref","is-referenced-by-count":20,"title":["Using SAT Solving to Improve Differential Fault Analysis of Trivium"],"prefix":"10.1007","author":[{"given":"Mohamed Saied Emam","family":"Mohamed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"Bulygin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Albrecht, M., Soos, M.: ANF2CNF \u2013 Converting ANF to CNF for algebraic attack using SAT solver (2008), \n                  \n                    http:\/\/bitbucket.org\/malb\/algebraicattacks\/src"},{"key":"7_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9","volume-title":"Algebraic Cryptanalysis","author":"G.V. Bard","year":"2009","unstructured":"Bard, G.V.: Algebraic Cryptanalysis. Springer, London (2009)"},{"issue":"9","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.jsc.2008.02.017","volume":"44","author":"M. Brickenstein","year":"2009","unstructured":"Brickenstein, M., Dreyer, A.: PolyBoRi: A framework for Gr\u00f6bner-basis computations with Boolean polynomials. Journal of Symbolic Computation\u00a044(9), 1326\u20131345 (2009); Effective Methods in Algebraic Geometry","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR4","unstructured":"Canniere, C.D., Preneel, B.: Trivium specifications. eSTREAM, ECRYPT Stream Cipher Project (2006)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-71039-4_6","volume-title":"Fast Software Encryption","author":"N.T. Courtois","year":"2008","unstructured":"Courtois, N.T., Bard, G.V., Wagner, D.: Algebraic and slide attacks on keeLoq. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 97\u2013115. Springer, Heidelberg (2008)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-79719-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"T. Eibach","year":"2008","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking bivium using SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 63\u201376. Springer, Heidelberg (2008)"},{"issue":"1-3","key":"7_CR7","doi-asserted-by":"publisher","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). Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Pure and Applied Algebra"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC)","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 75\u201383. ACM Press, Lille (2002)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-89754-5_19","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"M. Hojs\u00edk","year":"2008","unstructured":"Hojs\u00edk, M., Rudolf, B.: Floating fault analysis of trivium. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 239\u2013250. Springer, Heidelberg (2008)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-14423-3_7","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"M.S.E. Mohamed","year":"2010","unstructured":"Mohamed, M.S.E., Cabarcas, D., Ding, J., Buchmann, J., Bulygin, S.: MXL3: An efficient algorithm for computing gr\u00f6bner bases of zero-dimensional ideals. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 87\u2013100. Springer, Heidelberg (2010) (accepted for publication)"},{"key":"7_CR11","unstructured":"Niklas Een, N.S.: MinSat 2.0 \u2013 one of the best known SAT solvers (2008), \n                  \n                    http:\/\/minisat.se\/MiniSat.html"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-68351-3_1","volume-title":"New Stream Cipher Designs","author":"M. Robshaw","year":"2008","unstructured":"Robshaw, M.: The estream project. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs, pp. 1\u20136. Springer, Heidelberg (2008)"}],"container-title":["Communications in Computer and Information Science","Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23141-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T11:23:20Z","timestamp":1554031400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23141-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231407","9783642231414"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23141-4_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}