{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:36:45Z","timestamp":1778549805456,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540727873","type":"print"},{"value":"9783540727880","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72788-0_36","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T08:25:22Z","timestamp":1183019122000},"page":"377-382","source":"Crossref","is-referenced-by-count":25,"title":["Inversion Attacks on Secure Hash Functions Using sat Solvers"],"prefix":"10.1007","author":[{"given":"Debapratim","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abishek","family":"Kumarasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., et al.: Chaff: Engineering an efficient sat solver. In: Proc. Design Automation Conference (DAC) (June 2001)","DOI":"10.1145\/378239.379017"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Lai","year":"2005","unstructured":"Lai, X., et al.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to break md5 and other hash functions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Y.L. Yin","year":"2005","unstructured":"Yin, Y.L., Wang, X., Yu, H.: Efficient Collision Search Attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2005)"},{"key":"36_CR7","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":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-38424-3_22","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"R.L. Rivest","year":"1991","unstructured":"Rivest, R.L.: The MD4 Message Digest Algorithm. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 303\u2013311. Springer, Heidelberg (1991)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The md5 message digest algorithm. RFC 1321, The Internet Engineering Task Force (1992)","DOI":"10.17487\/rfc1321"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69710-1_19","volume-title":"Fast Software Encryption","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin, H.: The md4 message digest algorithm. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol.\u00a01372, Springer, Heidelberg (1998)"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","first-page":"61","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Biere","year":"2005","unstructured":"Biere, A., E\u00e9n, N.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72788-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:05:13Z","timestamp":1605744313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727873","9783540727880"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_36","relation":{},"subject":[]}}