{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:58:05Z","timestamp":1743119885012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030166915"},{"type":"electronic","value":"9783030166922"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16692-2_16","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"237-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis"],"prefix":"10.1007","author":[{"given":"Artem","family":"Pavlenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Ulyantsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9","volume-title":"Algebraic Cryptanalysis","author":"GV Bard","year":"2009","unstructured":"Bard, G.V.: Algebraic Cryptanalysis. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-88757-9"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1186\/s40064-016-2187-4","volume":"5","author":"A Semenov","year":"2016","unstructured":"Semenov, A., Zaikin, O.: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. SpringerPlus 5(1), 554 (2016)","journal-title":"SpringerPlus"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Semenov, A., Zaikin, O., Otpuschennikov, I., Kochemazov, S., Ignatiev, A.: On cryptographic attacks using backdoors for SAT. In: Proceedings of AAAI 2018, pp. 6641\u20136648 (2018)","DOI":"10.1609\/aaai.v32i1.12205"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"16_CR5","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"key":"16_CR6","unstructured":"Anderson, R.: A5 (was: hacking digital phones). Newsgroup Communication (1994). http:\/\/yarchive.net\/phone\/gsmcipher.html"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-85053-3_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"T Gendrullis","year":"2008","unstructured":"Gendrullis, T., Novotn\u00fd, M., Rupp, A.: A real-world attack breaking A5\/1 within hours. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 266\u2013282. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85053-3_17"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-77272-9_10","volume-title":"Cryptography and Coding","author":"NT Courtois","year":"2007","unstructured":"Courtois, N.T., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 152\u2013169. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77272-9_10"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2478\/v10127-012-0039-3","volume":"53","author":"NT Courtois","year":"2012","unstructured":"Courtois, N.T., Gawinecki, J.A., Song, G.: Contradiction immunity and guess-then-determine attacks on GOST. Tatra Mountains Math. Publ. 53, 65\u201379 (2012)","journal-title":"Tatra Mountains Math. Publ."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-23178-0_43","volume-title":"Parallel Computing Technologies","author":"A Semenov","year":"2011","unstructured":"Semenov, A., Zaikin, O., Bespalov, D., Posypkin, M.: Parallel logical cryptanalysis of the generator A5\/1 in BNB-grid system. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 473\u2013483. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23178-0_43"},{"key":"16_CR11","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Frontiers in Artificial Intelligence and Applications, vol. 85, pp. 131\u2013153 (2009)"},{"issue":"1\u20133","key":"16_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean optimization. Discrete Appl. Math. 123(1\u20133), 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"16_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"issue":"247","key":"16_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/01621459.1949.10483310","volume":"44","author":"N Metropolis","year":"1949","unstructured":"Metropolis, N., Ulam, S.: The Monte Carlo method. J. Am. Stat. Assoc. 44(247), 335\u2013341 (1949)","journal-title":"J. Am. Stat. Assoc."},{"key":"16_CR15","volume-title":"Convergence Properties of Evolutionary Algorithms","author":"G Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovac, Hamburg (1997)"},{"key":"16_CR16","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI 2003, pp. 1173\u20131178 (2003)"},{"key":"16_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes, A.J., Vanstone, S.A., Oorschot, P.C.V.: Handbook of Applied Cryptography, 1st edn. CRC Press Inc., Boca Raton (1996)","edition":"1"},{"key":"16_CR18","first-page":"1","volume-title":"Attacking Phone Privacy","author":"K Nohl","year":"2010","unstructured":"Nohl, K.: Attacking Phone Privacy, pp. 1\u20136. Black Hat, Las Vegas (2010)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11836810_13","volume-title":"Information Security","author":"C Canni\u00e8re","year":"2006","unstructured":"Canni\u00e8re, C.: Trivium: a stream cipher construction inspired by block cipher design principles. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 171\u2013186. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11836810_13"},{"key":"16_CR20","unstructured":"Raddum, H.: Cryptanalytic Results on Trivium. eSTREAM, ECRYPT Stream Cipher Project, Report 2006\/039 (2006)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-77360-3_3","volume-title":"Selected Areas in Cryptography","author":"A Maximov","year":"2007","unstructured":"Maximov, A., Biryukov, A.: Two trivial attacks on Trivium. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 36\u201355. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77360-3_3"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-79719-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"T Eibach","year":"2008","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking Bivium using SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 63\u201376. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_7"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s11786-009-0016-7","volume":"3","author":"T Eibach","year":"2010","unstructured":"Eibach, T., V\u00f6lkel, G., Pilz, E.: Optimising Gr\u00f6bner bases on Bivium. Math. Comput. Sci. 3(2), 159\u2013172 (2010)","journal-title":"Math. Comput. Sci."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-21969-6_5","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"Z Huang","year":"2011","unstructured":"Huang, Z., Lin, D.: Attacking Bivium and Trivium with the characteristic set method. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 77\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_5"},{"issue":"01","key":"16_CR26","first-page":"55","volume":"14","author":"A Castro Lechtaler","year":"2014","unstructured":"Castro Lechtaler, A., Cipriano, M., Garc\u00eda, E., Liporace, J., Maiorano, A., Malvacio, E.: Model design for a reduced variant of a Trivium type stream cipher. J. Comput. Sci. Technol. 14(01), 55\u201358 (2014)","journal-title":"J. Comput. Sci. Technol."},{"key":"16_CR27","unstructured":"Teo, S.G., Wong, K.K.H., Bartlett, H., Simpson, L., Dawson, E.: Algebraic analysis of Trivium-like ciphers. In: Australasian Information Security Conference (ACSW-AISC 2014), vol. 149, pp. 77\u201381. Australian Computer Society (2014)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-39118-5_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1987","author":"CG G\u00fcnther","year":"1988","unstructured":"G\u00fcnther, C.G.: Alternating step generators controlled by De Bruijn sequences. In: Chaum, D., Price, W.L. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 5\u201314. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-39118-5_2"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77360-3_1","volume-title":"Selected Areas in Cryptography","author":"S Khazaei","year":"2007","unstructured":"Khazaei, S., Fischer, S., Meier, W.: Reduced complexity attacks on the alternating step generator. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 1\u201316. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77360-3_1"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/0-387-34805-0_16","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","author":"K Zeng","year":"1990","unstructured":"Zeng, K., Yang, C.H., Rao, T.R.N.: On the Linear Consistency Test (LCT) in cryptanalysis with applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 164\u2013174. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_16"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-69659-1_2","volume-title":"Information Security","author":"O Zaikin","year":"2017","unstructured":"Zaikin, O., Kochemazov, S.: An improved SAT-based guess-and-determine attack on the alternating step generator. In: Nguyen, P., Zhou, J. (eds.) ISC 2017. LNCS, vol. 10599, pp. 21\u201338. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69659-1_2"},{"key":"16_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"16_CR33","unstructured":"Yasumoto, T., Okuwaga, T.: ROKK 1.0.1. In: Belov, A., Diepold, D., Heule, M., J\u00e4rvisalo, M. (eds.) SAT Competition 2014, p. 70 (2014)"},{"key":"16_CR34","unstructured":"Otpuschennikov, I., Semenov, A., Gribanova, I., Zaikin, O., Kochemazov, S.: Encoding cryptographic functions to SAT using TRANSALG system. In: ECAI 2016. FAIA, vol. 285, pp. 1594\u20131595 (2016)"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16692-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T16:26:53Z","timestamp":1663259213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16692-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030166915","9783030166922"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16692-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leipzig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2019\/cfp_evoapps.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"MyReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}