{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:10:57Z","timestamp":1769281857383,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642332593","type":"print"},{"value":"9783642332609","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33260-9_4","type":"book-chapter","created":{"date-parts":[[2012,9,20]],"date-time":"2012-09-20T04:27:01Z","timestamp":1348115221000},"page":"56-67","source":"Crossref","is-referenced-by-count":16,"title":["Security Margin Evaluation of SHA-3 Contest Finalists through SAT-Based Attacks"],"prefix":"10.1007","author":[{"given":"Ekawat","family":"Homsirikamol","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Morawiecki","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Rogawski","sequence":"additional","affiliation":[]},{"given":"Marian","family":"Srebrny","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Audemard, G., Simon, L.: Glucose SAT Solver, \n                    \n                      http:\/\/www.lri.fr\/~simon\/?page=glucose"},{"key":"4_CR2","unstructured":"Schneier, B., et al.: The Skein Hash Function Family, \n                    \n                      http:\/\/www.skein-hash.info\/sites\/default\/files\/skein1.1.pdf"},{"key":"4_CR3","unstructured":"Bernstein, D.J.: Second preimages for 6 (7? (8??)) rounds of Keccak? NIST mailing list (2010), \n                    \n                      http:\/\/ehash.iaik.tugraz.at\/uploads\/6\/65\/NIST-mailing-list_Bernstein-Daemen.txt"},{"key":"4_CR4","unstructured":"Biere, A.: Lingeling, \n                    \n                      http:\/\/fmv.jku.at\/lingeling"},{"key":"4_CR5","unstructured":"Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., Shamir, A.: Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds. Cryptology ePrint Archive, Report 2009\/374 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/374"},{"key":"4_CR6","unstructured":"Bouillaguet, C., Derbez, P., Dunkelman, O., Keller, N., Rijmen, V., Fouque, P.A.: Low Data Complexity Attacks on AES. Cryptology ePrint Archive, Report 2010\/633 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/2010\/633"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. ACM, New York (1971)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: A survey, pp. 1\u201317. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"N.T. Courtois","year":"2002","unstructured":"Courtois, N.T., Pieprzyk, J.: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 267\u2013287. Springer, Heidelberg (2002)"},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"7","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a07(5), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0166-218X(02)00400-6","volume":"130","author":"C. Fiorini","year":"2003","unstructured":"Fiorini, C., Martinelli, E., Massacci, F.: How to fake an RSA signature by encoding modular root finding as a SAT problem. Discrete Applied Mathematics\u00a0130, 101\u2013127 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR13","unstructured":"Bertoni, G., et al.: Keccak sponge function family main document, \n                    \n                      http:\/\/keccak.noekeon.org\/Keccak-main-2.1.pdf"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gaj, K., Chodowiec, P.: FPGA and ASIC Implementatios of AES. In: Koc, C.K. (ed.) Cryptographic Engineering, ch. 10, pp. 235\u2013294. Springer (2009)","DOI":"10.1007\/978-0-387-71817-0_10"},{"key":"4_CR15","unstructured":"Aumasson, J.P., et al.: SHA-3 proposal BLAKE, \n                    \n                      http:\/\/www.131002.net\/blake\/"},{"key":"4_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11559306_11","volume-title":"Frontiers of Combining Systems","author":"D. Jovanovi\u0107","year":"2005","unstructured":"Jovanovi\u0107, D., Jani\u010di\u0107, P.: Logical Analysis of Hash Functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 200\u2013215. Springer, Heidelberg (2005)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Lala, P.K.: Principles of modern digital design. Wiley-Interscience (2007)","DOI":"10.1002\/0470125217"},{"key":"4_CR18","unstructured":"Massacci, F.: Using Walk-SAT and Rel-SAT for cryptographic key search. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 290\u2013295 (1999)"},{"key":"4_CR19","unstructured":"Mendel, F., Thomsen, S.: An Observation on JH-512 (2008), \n                    \n                      http:\/\/ehash.iaik.tugraz.at\/uploads\/d\/da\/Jh_preimage.pdf"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11814948_13","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"I. Mironov","year":"2006","unstructured":"Mironov, I., Zhang, L.: Applications of SAT Solvers to Cryptanalysis of Hash Functions. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 102\u2013115. Springer, Heidelberg (2006)"},{"key":"4_CR21","unstructured":"Gauravaram, P., et al.: Gr\u00f8stl \u2014 a SHA-3 candidate, \n                    \n                      http:\/\/www.groestl.info"},{"key":"4_CR22","unstructured":"Rivest, R., et al.: The MD6 hash function, \n                    \n                      http:\/\/groups.csail.mit.edu\/cis\/md6\/"},{"key":"4_CR23","unstructured":"Schlaffer, M.: Updated Differential Analysis of Gr\u00f8estl. Gr\u00f8stl website (January 2011), \n                    \n                      http:\/\/groestl.info\/groestl-analysis.pdf"},{"key":"4_CR24","unstructured":"Soos, M.: CryptoMiniSat 2.5.0. In: SAT Race Competitive Event Booklet (July 2010), \n                    \n                      http:\/\/www.msoos.org\/cryptominisat2"},{"key":"4_CR25","unstructured":"Soos, M.: Grain of Salt \u2014 An Automated Way to Test Stream Ciphers through SAT Solvers. In: Workshop on Tools for Cryptanalysis (2010)"},{"key":"4_CR26","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)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"4_CR28","unstructured":"Wu, H.: Hash Function JH, \n                    \n                      http:\/\/www3.ntu.edu.sg\/home\/wuhj\/research\/jh\/"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33260-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:00:38Z","timestamp":1620115238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33260-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332593","9783642332609"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33260-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}