{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:19:18Z","timestamp":1783613958577,"version":"3.55.0"},"reference-count":22,"publisher":"IEEE","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9,28]]},"DOI":"10.23919\/mipro48935.2020.9245337","type":"proceedings-article","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T21:51:34Z","timestamp":1604699494000},"page":"1212-1217","source":"Crossref","is-referenced-by-count":5,"title":["Constructing a Set of Weak Values for Full-round MD4 Hash Function"],"prefix":"10.23919","author":[{"given":"Irina","family":"Gribanova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69710-1_19"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_36"},{"key":"ref12","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"2003","journal-title":"SAT"},{"key":"ref13","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"ref15","first-page":"29:1","article-title":"Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems","volume":"16","author":"semenov","year":"2020","journal-title":"Logical Methods in Computer Science"},{"key":"ref16","first-page":"131","article-title":"Conflict-driven clause learning sat solvers","volume":"185","author":"marques-silva","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref17","first-page":"412","article-title":"Circuit complexity and decompositions of global constraints","author":"bessiere","year":"2009","journal-title":"Proc of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1134\/S1064230709050062"},{"key":"ref19","first-page":"1594","article-title":"Encoding cryptographic functions to SAT using Transalg system","volume":"285","author":"otpuschennikov","year":"2016","journal-title":"ECAI 2016 Proceedings ser Frontiers in Artificial Intelligence and Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_1"},{"key":"ref3","first-page":"416","article-title":"A design principle for hash functions","author":"damg\u00e5ard","year":"1989","journal-title":"Advances in Cryptology Proc of Crypto"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71039-4_26"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74619-5_21"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO.2018.8400213"},{"key":"ref2","first-page":"218","article-title":"A certified digital signature","author":"merkle","year":"1989","journal-title":"Advances in Cryptology Proc of Crypto"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1186"},{"key":"ref9","volume":"1","author":"feller","year":"1968","journal-title":"Introduction to Probability Theory and its Applications"},{"key":"ref20","year":"0","journal-title":"Irkutsk Supercomputer Center of SB RAS"},{"key":"ref22","first-page":"6641","article-title":"On cryptographic attacks using backdoors for SAT","author":"semenov","year":"2018","journal-title":"Proc of the 32nd AAAI Conference on Artificial Intelligence (AAAI‘2018)"},{"key":"ref21","first-page":"70","article-title":"Rokk 1.0.1","author":"yasumoto","year":"2014","journal-title":"The SAT 2014 competition"}],"event":{"name":"2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO)","location":"Opatija, Croatia","start":{"date-parts":[[2020,9,28]]},"end":{"date-parts":[[2020,10,2]]}},"container-title":["2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9245088\/9245075\/09245337.pdf?arnumber=9245337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T05:10:11Z","timestamp":1610514611000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9245337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":22,"URL":"https:\/\/doi.org\/10.23919\/mipro48935.2020.9245337","relation":{},"subject":[],"published":{"date-parts":[[2020,9,28]]}}}