{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:05:57Z","timestamp":1730282757899,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,20]]},"DOI":"10.1109\/mipro60963.2024.10569193","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T17:55:56Z","timestamp":1719597356000},"page":"25-30","source":"Crossref","is-referenced-by-count":0,"title":["Towards Better SAT Encodings for Hash Function Inversion Problems"],"prefix":"10.1109","author":[{"given":"S.E.","family":"Kochemazov","sequence":"first","affiliation":[{"name":"ISDCT SB RAS,Irkutsk,Russia"}]},{"given":"O.S.","family":"Zaikin","sequence":"additional","affiliation":[{"name":"ISDCT SB RAS,Irkutsk,Russia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/263"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/9780429466335"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1186"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60865-6_43"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69710-1_19"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_36"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2012.128"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190099"},{"key":"ref9","first-page":"98","article-title":"The study of inversion problems of cryptographic hash functions from MD family using algorithms for solving Boolean satisfiability problem","author":"Gribanova","year":"2017","journal-title":"MIT"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO48935.2020.9245337"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3174"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_19"},{"key":"ref13","article-title":"SAT as a programming environment for linear algebra and cryptanalysis","author":"Srebrny","year":"2008","journal-title":"ISAIM"},{"key":"ref14","article-title":"Handbook of Satisfiability - Second Edition, ser","volume":"336","author":"Biere","year":"2021","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"ref15","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979","journal-title":"W. H. Freeman"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3233\/faia201002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2003.1290218"},{"issue":"1","key":"ref21","article-title":"Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems","volume":"16","author":"Semenov","year":"2020","journal-title":"Log. Methods Comput. Sci."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190014"},{"issue":"5","key":"ref23","first-page":"349","article-title":"Some schemes for parallel multipliers","volume":"34","author":"Dadda","year":"1965","journal-title":"Alta Frequenza"},{"volume-title":"SAT-based preimage attacks on SHA-1","year":"2012","author":"Nossum","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72308-2_8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263830"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6"}],"event":{"name":"2024 47th MIPRO ICT and Electronics Convention (MIPRO)","start":{"date-parts":[[2024,5,20]]},"location":"Opatija, Croatia","end":{"date-parts":[[2024,5,24]]}},"container-title":["2024 47th MIPRO ICT and Electronics Convention (MIPRO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10569139\/10569147\/10569193.pdf?arnumber=10569193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T04:13:21Z","timestamp":1719720801000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10569193\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/mipro60963.2024.10569193","relation":{},"subject":[],"published":{"date-parts":[[2024,5,20]]}}}