{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:50:20Z","timestamp":1765356620160,"version":"3.37.3"},"reference-count":66,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["19-07-00746-a"],"award-info":[{"award-number":["19-07-00746-a"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,7,4]]},"DOI":"10.1080\/10556788.2019.1685993","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T12:20:25Z","timestamp":1573474825000},"page":"672-696","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":9,"title":["On black-box optimization in divide-and-conquer SAT solving"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0145-5010","authenticated-orcid":false,"given":"O. S.","family":"Zaikin","sequence":"first","affiliation":[{"name":"Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2848-5786","authenticated-orcid":false,"given":"S. E.","family":"Kochemazov","sequence":"additional","affiliation":[{"name":"Matrosov Institute for System Dynamics and Control Theory SB RAS, Irkutsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"CIT0001","unstructured":"ALIAS a modular tool for finding backdoors for SAT. Available at https:\/\/github.com\/nauchnik\/alias."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"S. Babbage and M. Dodd, The MICKEY stream ciphers, in New Stream Cipher Designs \u2013 The eSTREAM Finalists, M.J.B. Robshaw and Olivier Billet, eds. Lecture Notes in Computer Science, Vol. 4986, Springer, Berlin, 2008, pp. 191\u2013209.","DOI":"10.1007\/978-3-540-68351-3_15"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.08.007"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9"},{"key":"CIT0006","unstructured":"A. Biere, M. Heule, H. van Maaren and T. Walsh, Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, Vol. 185, IOS Press, Amsterdam, 2009."},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"M. Boesgaard, M. Vesterager, and E. Zenner, The Rabbit stream cipher, in New Stream Cipher Designs \u2013 The eSTREAM Finalists, Matthew J.B. Robshaw and Olivier Billet, eds. Lecture Notes in Computer Science, Vol. 4986, Springer, Berlin, 2008, pp. 69\u201383.","DOI":"10.1007\/978-3-540-68351-3_7"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"E. Clarke, D. Kroening, and F. Lerda, A tool for checking ANSI-C programs, in Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), K. Jensen and A. Podelski, eds. Lecture Notes in Computer Science, Vol. 2988, Springer, Berlin, 2004, pp. 168\u2013176.","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/035\/01"},{"key":"CIT0012","unstructured":"S.A. Cook, The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3\u20135, 1971, Shaker Heights, OH, USA, 1971, pp. 151\u2013158."},{"issue":"1","key":"CIT0013","first-page":"2","volume":"53","author":"Courtois N.T.","year":"2012","journal-title":"Tatra Mt. Math. Publ."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"C. De Canni\u00e8re and B. Preneel, Trivium, in New Stream Cipher Designs \u2013 The eSTREAM Finalists, Matthew J.B. Robshaw and Olivier Billet, eds. Lecture Notes in Computer Science, Vol. 4986, Springer, Berlin, 2008, pp. 244\u2013266.","DOI":"10.1007\/978-3-540-68351-3_18"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"#cr-split#-CIT0017.1","unstructured":"T. Eibach, E. Pilz, and G. V\u00f6lkel, Attacking Bivium using SAT Solvers, in H.K. Bning and X. Zhao, eds. Proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, 12-15 May 2008"},{"key":"#cr-split#-CIT0017.2","unstructured":"Guangzhou, China, 2008, pp. 63-76."},{"key":"CIT0018","unstructured":"eSTREAM: The ECRYPT stream cipher project. Available at http:\/\/www.ecrypt.eu.org\/stream\/."},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542516120083"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82542-3"},{"volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","year":"1990","author":"Garey M.R.","key":"CIT0021"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39118-5_2"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"CIT0027","unstructured":"N. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation, Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996, pp. 312\u2013317."},{"key":"CIT0028","doi-asserted-by":"crossref","unstructured":"M. Hell, T. Johansson, A. Maximov, and W. Meier, The grain family of stream ciphers, in New Stream Cipher Designs-The eSTREAM Finalists, Matthew J.B. Robshaw and Olivier Billet, eds. Lecture Notes in Computer Science, Vol. 4986, Springer, Berlin, 2008, pp. 179\u2013190.","DOI":"10.1007\/978-3-540-68351-3_14"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63516-3_2"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"M.J.H. Heule, O. Kullmann, S. Wieringa and A. Biere, Cube and conquer: Guiding CDCL SAT solvers by lookaheads, in Hardware and Software: Verification and Testing, Lecture Notes in Computer Science, Vol. 7261, Springer, Berlin, Heidelberg, 2012, pp. 50\u201365.","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1145\/321062.321069"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"F. Hutter, H.H. Hoos, and K. Leyton-Brown, Sequential model-based optimization for general algorithm configuration, in Carlos A. Coello Coello, ed. Learning and Intelligent Optimization-5th International Conference, LION 5, Rome, Italy, January 17\u201321, 2011. Selected Papers, Lecture Notes in Computer Science, Vol. 6683, Springer, Berlin, 2011, pp. 507\u2013523.","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"CIT0034","doi-asserted-by":"crossref","unstructured":"A.E.J. Hyv\u00e4rinen, T. Junttila, and I. Niemel\u00e4, A distribution method for solving SAT in grids, in Theory and Applications of Satisfiability Testing-SAT 2006, A. Biere and C.P. Gomes, eds. Lecture Notes in Computer Science, Vol. 4121, Springer, Berlin, 2006, pp. 430\u2013435.","DOI":"10.1007\/11814948_39"},{"key":"CIT0035","doi-asserted-by":"crossref","unstructured":"A.E.J. Hyv\u00e4rinen, T.A. Junttila, and I. Niemel\u00e4, Partitioning SAT instances for distributed solving, in C.G. Ferm\u00fcller and A. Voronkov, eds. Logic for Programming, Artificial Intelligence, and Reasoning-17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10\u201315, 2010. Proceedings, Lecture Notes in Computer Science, Vol. 6397, Springer, Berlin, 2010, pp. 372\u2013386.","DOI":"10.1007\/978-3-642-16242-8_27"},{"key":"CIT0036","unstructured":"Irkutsk supercomputer center of SB RAS. Available at http:\/\/hpc.icc.ru."},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(3:30)2012"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_25"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2017.0176"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"CIT0042","unstructured":"J.P. Marques Silva and K.A. Sakallah, GRASP: A new search algorithm for satisfiability, in Proceedings of the 1996 IEEE\/ACM International Conference on Computer-aided Design, ICCAD '96, 1996, pp. 220\u2013227."},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006326723002"},{"key":"CIT0044","unstructured":"F. Massacci, Using Walk-SAT and Rel-SAT for cryptographic key search, in IJCAI'99, 1999, pp. 290\u2013295."},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77360-3_3"},{"key":"CIT0046","unstructured":"C. Mcdonald, C. Charnes, and J. Pieprzyk, Attacking Bivium with MiniSat. Technical Report 2007\/040, ECRYPT Stream Cipher Project, 2007."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1949.10483310"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.17265\/2159-5313\/2016.09.003"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321847"},{"key":"CIT0051","doi-asserted-by":"crossref","unstructured":"A. Pavlenko, A. Semenov, and V. Ulyantsev, Evolutionary computation techniques for constructing sat-based attacks in algebraic cryptanalysis, in Applications of Evolutionary Computation-22nd International Conference, EvoApplications 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24\u201326, 2019, Proceedings, P. Kaufmann and P.A. Castillo, eds. Lecture Notes in Computer Science, Vol. 11454, Springer, Cham, 2019, pp. 237\u2013253.","DOI":"10.1007\/978-3-030-16692-2_16"},{"key":"CIT0052","doi-asserted-by":"crossref","unstructured":"M.J.B. Robshaw and O. Billet, New stream cipher designs-the eSTREAM Finalists, Lecture Notes in Computer Science, Vol. 4986, Springer, Berlin, 2008.","DOI":"10.1007\/978-3-540-68351-3"},{"key":"CIT0053","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S.","year":"2009","edition":"3"},{"key":"CIT0054","unstructured":"A.A. Semenov, I.V. Otpuschennikov, I. Gribanova, O. Zaikin and S. Kochemazov, Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems. CoRR, abs\/1805.07239, 2018."},{"key":"CIT0055","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-2187-4"},{"key":"CIT0056","doi-asserted-by":"crossref","unstructured":"A. Semenov, O. Zaikin, D. Bespalov and M. Posypkin, Parallel logical cryptanalysis of the generator A5\/1 in BNB-grid system, in 11th International Conference on Parallel Computing Technologies-PaCT 2011, Lecture Notes in Computer Science, Vol. 6873, Springer, Berlin, 2011, pp. 473\u2013483.","DOI":"10.1007\/978-3-642-23178-0_43"},{"key":"CIT0057","doi-asserted-by":"crossref","unstructured":"A. Semenov, O. Zaikin, I. Otpuschennikov, S. Kochemazov and A. Ignatiev, On cryptographic attacks using backdoors for SAT, in The Thirty-Second AAAI Conference on Artificial Intelligence, AAAI'2018, 2018, pp. 6641\u20136648.","DOI":"10.1609\/aaai.v32i1.12205"},{"key":"CIT0058","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"CIT0059","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"CIT0060","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175354"},{"key":"CIT0061","unstructured":"T. Yasumoto and T. Okuwaga, Rokk 1.0.1., in SAT Competition 2014, A. Belov, D. Diepold, M. Heule, and M. J\u00e4rvisalo, eds., University of Helsinki, Helsinki, 2014, p. 70."},{"key":"CIT0062","doi-asserted-by":"crossref","unstructured":"O. Zaikin and S. Kochemazov, An improved SAT-based guess-and-determine attack on the alternating step generator, in ISC 2017, Lecture Notes in Computer Science, Vol. 10599, Springer, Cham, 2017, pp. 21\u201338.","DOI":"10.1007\/978-3-319-69659-1_2"},{"key":"CIT0063","doi-asserted-by":"publisher","DOI":"10.12783\/dtcse\/optim2018\/27923"},{"key":"CIT0064","doi-asserted-by":"crossref","unstructured":"O. Zaikin and S. Kochemazov, Black-box optimization in an extended search space for SAT solving, in Mathematical Optimization Theory and Operations Research-18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8\u201312, 2019, Proceedings, M. Khachay, Y. Kochetov, and P.M. Pardalos, eds., Lecture Notes in Computer Science, Vol. 11548, Springer, Cham, 2019, pp. 402\u2013417.","DOI":"10.1007\/978-3-030-22629-9_28"},{"key":"CIT0065","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0030"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1685993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T12:13:47Z","timestamp":1662380027000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1685993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":66,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7,4]]}},"alternative-id":["10.1080\/10556788.2019.1685993"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1685993","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-03-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}