{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T00:03:47Z","timestamp":1756771427398,"version":"3.44.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.23919\/mipro.2019.8757214","type":"proceedings-article","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T20:17:40Z","timestamp":1562876260000},"page":"1144-1149","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis"],"prefix":"10.23919","author":[{"given":"A.","family":"Pavlenko","sequence":"first","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Semenov","sequence":"additional","affiliation":[{"name":"ISDCT SB RAS, Irkutsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Ulyantsev","sequence":"additional","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Zaikin","sequence":"additional","affiliation":[{"name":"ISDCT SB RAS, Irkutsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"271","article-title":"Exploiting Runtime Variation in Complete Solvers","volume":"9","author":"gomes","year":"0","journal-title":"Handbook of Satisfiability"},{"key":"ref11","first-page":"554","volume":"5","author":"semenov","year":"2016","journal-title":"Algorithm for finding partitionings of hard variants of Boolean satisfiability problem with application to inversion of some cryptographic functions"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_25"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref13"},{"key":"ref14","first-page":"1594","article-title":"Encoding Cryptographic Functions to SAT Using TRANSALG System","volume":"285","author":"otpuschennikov","year":"2016","journal-title":"ECAI 2016 FAIA"},{"key":"ref15","first-page":"76","article-title":"Pseudo-Boolean Black-Box optimization Methods in the Context of Divide-and-Conquer Approach to Solving Hard SAT Instances","author":"zaikin","year":"2018","journal-title":"DEStech Transactions on Computer Science and Engineering"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2280232"},{"journal-title":"Essentials of Metaheuristics","year":"2015","author":"luke","key":"ref17"},{"journal-title":"Siberian Branch of the Rissian Academy of Sciences","year":"2019","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/11799313_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_36"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_13"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23178-0_43"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_26"},{"key":"ref7","first-page":"65","volume":"53","author":"courtois","year":"2012","journal-title":"Contradiction Immunity and Guess-then-Determine Attacks on GOST"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77272-9_10"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9"},{"key":"ref9","first-page":"6641","article-title":"Ignatiev A. On Cryptographic Attacks Using Backdoors for SAT","author":"semenov","year":"2018","journal-title":"Proceedings of AAAI-2018"},{"journal-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","year":"1965","author":"buchberger","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34047-5_18"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","article-title":"A New Efficient Algorithm for Computing Grobner Bases (F4)","volume":"139","author":"faug\u00e9re","year":"1999","journal-title":"Journal of Pure and Applied Algebra"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s11424-008-9103-0","article-title":"A Characteristic Set Method for Solving Boolean Equations and Applications in Cryptanalysis of Stream Ciphers","volume":"21","author":"fengiuan","year":"2008","journal-title":"Journal of Systems Science and Complexity"}],"event":{"name":"2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","start":{"date-parts":[[2019,5,20]]},"location":"Opatija, Croatia","end":{"date-parts":[[2019,5,24]]}},"container-title":["2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8747288\/8756637\/08757214.pdf?arnumber=8757214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:15:44Z","timestamp":1756754144000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8757214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":23,"URL":"https:\/\/doi.org\/10.23919\/mipro.2019.8757214","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}