{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:17Z","timestamp":1740169337431,"version":"3.37.3"},"reference-count":86,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of Russian Federation","doi-asserted-by":"publisher","award":["075-03-2020-139\/2","2019-1339"],"award-info":[{"award-number":["075-03-2020-139\/2","2019-1339"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3328215","type":"journal-article","created":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T18:00:16Z","timestamp":1698429616000},"page":"120319-120333","source":"Crossref","is-referenced-by-count":0,"title":["Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6172-4801","authenticated-orcid":false,"given":"Alexander","family":"Semenov","sequence":"first","affiliation":[{"name":"Information Technologies and Programming Faculty, ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0361-2582","authenticated-orcid":false,"given":"Kirill","family":"Antonov","sequence":"additional","affiliation":[{"name":"Department of Cryptography and Computer Systems Security, MEPhI University, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2848-5786","authenticated-orcid":false,"given":"Stepan","family":"Kochemazov","sequence":"additional","affiliation":[{"name":"Information Technologies and Programming Faculty, ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-4880","authenticated-orcid":false,"given":"Artem","family":"Pavlenko","sequence":"additional","affiliation":[{"name":"Information Technologies and Programming Faculty, ITMO University, Saint Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","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":"Log Methods Comput Sci"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_13"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA200987"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3229003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201011"},{"key":"ref59","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Pub Math Debrecen"},{"key":"ref14","first-page":"412","article-title":"Circuit complexity and decompositions of global constraints","author":"bessiere","year":"2009","journal-title":"Proc IJCAI"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23178-0_43"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90014-1"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-005-9007-9"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12206"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90038-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1949.10483310"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49059-0_14"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77272-9_10"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77360-3_1"},{"key":"ref45","first-page":"5","article-title":"Alternating step generators controlled by De Bruijn sequences","volume":"304","author":"g\u00fcnther","year":"1987","journal-title":"Adv Cryptology"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_16"},{"key":"ref42","first-page":"1","article-title":"Real time cryptanalysis of A5\/1 on a PC","volume":"1978","author":"biryukov","year":"2000","journal-title":"Fast Software Encryption"},{"key":"ref86","first-page":"79","article-title":"Zadacha o kratchaishem linearizacionnom mnozhestve (The problem of finding the shortest linearizing set)","volume":"4","author":"timoshevskaya","year":"2005","journal-title":"Vestnik Tomskogo Gosudarstvennogo Universiteta Prilozhenye Bull Tomsk State Univ"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref41"},{"key":"ref85","first-page":"31","article-title":"Logicheskye uravneniya v kriptoanalize generatorov kluchevogo potoka (Logical equations in cryptanalysis of keystream generators)","volume":"6","author":"agibalov","year":"2003","journal-title":"Vestnik Tomskogo Gosudarstvennogo Universiteta Prilozhenye Bull Tomsk State Univ"},{"key":"ref44","first-page":"239","article-title":"Cryptanalysis of alleged A5 stream cipher","volume":"1233","author":"golic","year":"1997","journal-title":"Adv Cryptology"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_17"},{"key":"ref49","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"williams","year":"2003","journal-title":"Proc IJCAI"},{"journal-title":"Aiger 1 9 and Beyond","year":"2011","author":"biere","key":"ref8"},{"journal-title":"The Complexity of Boolean Functions","year":"1987","author":"wegener","key":"ref7"},{"key":"ref9","first-page":"115","article-title":"On the complexity of derivation in propositional calculus","author":"tseitin","year":"1970","journal-title":"Studies in Constructive Mathematics and Mathematical Logic"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36178-2_17"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_27"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref6"},{"journal-title":"Symbolic Logic and Mechanical Theorem Proving","year":"1973","author":"chang","key":"ref5"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30891-8_15"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/263"},{"key":"ref40","first-page":"1","article-title":"Attacking phone privacy","author":"nohl","year":"2010","journal-title":"Proc BlackHat Lect Notes"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21277"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO48935.2020.9245337"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/11836810_13"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1685993"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"article-title":"Grid based propositional satisfiability solving","year":"2011","author":"hyv\u00e4rinen","key":"ref78"},{"journal-title":"Irkutsk Supercomputer Center of SB RAS","year":"2023","key":"ref37"},{"key":"ref36","first-page":"1594","article-title":"Encoding cryptographic functions to SAT using TRANSALG system","volume":"285","author":"otpuschennikov","year":"2016","journal-title":"Proc ECAI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69659-1_2"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_10"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21909-7_21"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79719-7_7"},{"key":"ref77","first-page":"50","article-title":"Cube and conquer: Guiding CDCL SAT solvers by lookaheads","volume":"7261","author":"heule","year":"2011","journal-title":"Proc Haifa Verification Conf (HVC)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77360-3_3"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09234-3_12"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213018400018"},{"journal-title":"EvoGuessAI Library","year":"2023","key":"ref38"},{"journal-title":"Attacking Bivium with MiniSat","year":"2007","author":"mcdonald","key":"ref71"},{"journal-title":"Cryptanalytic results on trivium","year":"2006","author":"raddum","key":"ref70"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.2478\/v10127-012-0039-3"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19574-7_4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66515-9_11"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1515\/eng-2018-0002"},{"journal-title":"Essentials of Metaheuristics","year":"2013","author":"luke","key":"ref26"},{"journal-title":"Search Methodologies Introductory Tutorials in Optimization and Decision Support Techniques","year":"2013","author":"burke","key":"ref25"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-2187-4"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113771"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16692-2_16"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.80"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12205"},{"key":"ref65","first-page":"115","article-title":"Universal sequential search problems","volume":"9","author":"levin","year":"1973","journal-title":"Problemy Peredachi Inf"},{"key":"ref28","volume":"2","author":"feller","year":"1971","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref27","first-page":"47:1","article-title":"Evaluating the hardness of SAT instances using evolutionary optimization algorithms","volume":"210","author":"semenov","year":"2021","journal-title":"Proc 27th Int Conf Princ Pract Constraint Program (CP)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(69)90015-0"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.18514\/MMN.2012.347"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.21136\/MB.2008.133947"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10298109.pdf?arnumber=10298109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T20:05:13Z","timestamp":1701115513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10298109\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":86,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3328215","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}