{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:47:50Z","timestamp":1771505270401,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811668890","type":"print"},{"value":"9789811668906","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_11","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"141-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["New Records of Pre-image Search of Reduced SHA-1 Using SAT Solvers"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Bellini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"De Piccoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rusydi","family":"Makarim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Polese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Riva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5689-8575","authenticated-orcid":false,"given":"Andrea","family":"Visconti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Dang Q (2015) FIPS PUB 180\u20134, Secure Hash Standard (SHS). US Department of Commerce, NIST","DOI":"10.6028\/NIST.FIPS.180-4"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Dang Q (2012) NIST SP 800\u2013107 Rev 1, Recommendation for applications using approved hash algorithms. US Department of Commerce, NIST","DOI":"10.6028\/NIST.SP.800-107r1"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Wang X, Yin YL, Yu H (2005) Finding collisions in the full SHA-1. In: Proceedings of EUROCRYPT 2005. Springer","DOI":"10.1007\/11535218_2"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Kelsey J, Schneier B (2005) Second preimages on $$n$$-bit hash functions for much less than $$2^n$$ work. In: Proceedings of EUROCRYPT 2005. Springer","DOI":"10.1007\/11426639_28"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bellare M, Canetti R, Krawczyk H (1996) Keying hash functions for message authentication. In: Proceedings of CRYPTO 1996. Springer","DOI":"10.1007\/3-540-68697-5_1"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Nejati S, Liang JH, Gebotys C, Czarnecki K, Ganesh V (2017) Adaptive restart and CEGAR-based solver for inverting cryptographic hash functions. In: Proceedings of VSTTE 2017. Springer","DOI":"10.1007\/978-3-319-72308-2_8"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Leurent G, Peyrin T (2019) From collisions to chosen-prefix collisions application to full SHA-1. In: Proceedings of EUROCRYPT 2019. Springer","DOI":"10.1007\/978-3-030-17659-4_18"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Stevens M, Bursztein E, Karpman P, Albertini A, Markov Y (2017) The first collision for full SHA-1. In: Proceedings of CRYPTO2017. Springer","DOI":"10.1007\/978-3-319-63688-7_19"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"De\u00a0Canni\u00e8re C, Rechberger C (2008) Preimages for reduced SHA-0 and SHA-1. In: Proceedings of CRYPTO 2008. Springer","DOI":"10.1007\/978-3-540-85174-5_11"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Aoki K, Sasaki Y (2009) Meet-in-the-middle preimage attacks against reduced SHA-0 and SHA-1. In: Proceedings of CRYPTO 2009. Springer","DOI":"10.1007\/978-3-642-03356-8_5"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Espitau T, Fouque PA, Karpman P (2015) Higher-order differential meet-in-the-middle preimage attacks on SHA-1 and BLAKE. In: Proceedings of CRYPTO 2015. Springer","DOI":"10.1007\/978-3-662-47989-6_33"},{"key":"11_CR12","unstructured":"The New RSA Factoring Challenge. http:\/\/tiny.cc\/osbbtz, Last accessed Dec 2020"},{"key":"11_CR13","unstructured":"Decodingchallenge.org. http:\/\/decodingchallenge.org, Last accessed Dec 2020"},{"key":"11_CR14","unstructured":"Ganesh V (2017) Adaptive restart and cegar-based solver for inverting cryptographic hash functions. In: Proceedings of VSTTE 2017. Springer"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Legendre F, Dequen G, Krajecki M (2012) Encoding hash functions as a sat problem. In: 24th international conference on tools with artificial intelligence. IEEE","DOI":"10.1109\/ICTAI.2012.128"},{"key":"11_CR16","unstructured":"Legendre F, Dequen G, Krajecki M (2014) Logical reasoning to detect weaknesses about sha-1 and md4\/5. IACR Cryptol. ePrint Arch. 2014:239"},{"key":"11_CR17","unstructured":"Nossum V (2012) SAT-based preimage attacks on SHA-1. Master\u2019s thesis, University of Oslo"},{"key":"11_CR18","unstructured":"Merkle R (1979) Secrecy, authentication, and public key systems. PhD Thesis, Stanford University"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Visconti A, Gorla F (2020) Exploiting an HMAC-SHA-1 optimization to speed up PBKDF2. IEEE Trans Dependable Secur Comput 17(4)","DOI":"10.1109\/TDSC.2018.2878697"},{"key":"11_CR20","unstructured":"Van\u00a0Harmelen F, Lifschitz V, Porter B (2007) Handbook of knowledge representation. Elsevier Science"},{"key":"11_CR21","unstructured":"Walsh T (1999) Search in a small world. In: Proceedings of IJCAI 1999. Morgan Kaufmann Publishers Inc"},{"key":"11_CR22","unstructured":"Gomes CP, Selman B, Kautz H (1998) Boosting combinatorial search through randomization. AAAI\/IAAI 98"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Luby M, Sinclair A, Zuckerman D (1993) Optimal speedup of las vegas algorithms. Inf Process Lett 47(4)","DOI":"10.1016\/0020-0190(93)90029-9"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Visconti A, Schiavo CV, Peralta R (2018) Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Inf Process Lett 137","DOI":"10.1016\/j.ipl.2018.04.010"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Iuorio AF, Visconti A (2019) Understanding optimizations and measuring performances of PBKDF2. In: Proceedings of WIDECOM 2019. Springer","DOI":"10.1007\/978-3-030-11437-4_8"},{"key":"11_CR26","unstructured":"Steube J (2013) Optimising computation of hash-algorithms as an attacker. http:\/\/hashcat.net\/events\/p13\/js-ocohaaaa.pdf"},{"key":"11_CR27","unstructured":"Shanatomy. https:\/\/github.com\/Crypto-TII\/shanatomy, Last accessed Jan 2021"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Soos M, Nohl K, Castelluccia C (2009) Extending SAT solvers to cryptographic problems. In: Proceedings of SAT 2009. Springer","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"E\u00e9n N, S\u00f6rensson N (2004) An extensible sat-solver. In: Proceedings of SAT 2004. Springer","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Cimatti A, Griggio A, Schaafsma B, Sebastiani R (2013) The MathSAT5 SMT solver. In: Proceedings of TACAS 2013. Springer","DOI":"10.1007\/978-3-642-36742-7_7"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Dutertre B (2014) Yices 2.2. In: Proceedings of CAV 2014. Springer","DOI":"10.1007\/978-3-319-08867-9_49"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:04:19Z","timestamp":1646489059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}