{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:20:54Z","timestamp":1754151654987,"version":"3.41.2"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030816513"},{"type":"electronic","value":"9783030816520"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81652-0_9","type":"book-chapter","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T06:26:19Z","timestamp":1626762379000},"page":"229-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boolean Polynomials, BDDs and CRHS Equations - Connecting the Dots with\u00a0CryptaPath"],"prefix":"10.1007","author":[{"given":"John Petter","family":"Indr\u00f8y","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Costes","sequence":"additional","affiliation":[]},{"given":"H\u00e5vard","family":"Raddum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,21]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-34618-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Algebraic cryptanalysis of\u00a0STARK-friendly designs: application to MARVELlous and MiMC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-662-44465-8_11","volume-title":"Mathematical Foundations of Computer Science 2014","author":"B Bollig","year":"2014","unstructured":"Bollig, B.: On the complexity of some ordering problems. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 118\u2013129. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_11"},{"doi-asserted-by":"crossref","unstructured":"Brickenstein, M., Dreyer, A.: POLYBORI: a framework for gr\u00f6bner-basis computations with Boolean polynomials. J. Symbol. Comput. 44(9), 1326\u20131345 (2009). Effective Methods in Algebraic Geometry","key":"9_CR4","DOI":"10.1016\/j.jsc.2008.02.017"},{"issue":"8","key":"9_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. (CSUR) 24(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"9_CR7","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"},{"unstructured":"van Dijk, T.: Sylvan (2019). https:\/\/github.com\/utwente-fmt\/sylvan","key":"9_CR8"},{"doi-asserted-by":"crossref","unstructured":"Dolmatov, V.: GOST 28147-89: Encryption, Decryption, and Message Authentication Code (MAC) Algorithms, March 2010. https:\/\/tools.ietf.org\/rfc\/rfc5830.txt","key":"9_CR9","DOI":"10.17487\/rfc5830"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing gr\u00f6bner bases without reduction to zero (F5). In: ISSAC 2002 (2002)","key":"9_CR11"},{"unstructured":"Filippidis, I.: dd (2020). https:\/\/github.com\/tulip-control\/dd","key":"9_CR12"},{"unstructured":"Garey, M.R., Johnson, D.S.: A guide to the theory of NP-completeness. Computers and intractability, pp. 641\u2013650 (1979)","key":"9_CR13"},{"unstructured":"Gossen, F., Murtovi, A., Linden, J., Steffen, B.: Add-lib 2.0.0 beta (2018). https:\/\/add-lib.scce.info","key":"9_CR14"},{"issue":"12","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.ress.2010.06.005","volume":"95","author":"K Groth","year":"2010","unstructured":"Groth, K., Wang, C., Mosleh, A.: Hybrid causal methodology and software platform for probabilistic risk assessment and safety monitoring of socio-technical systems. Reliab. Eng. Syst. Safety 95(12), 1276\u20131285 (2010)","journal-title":"Reliab. Eng. Syst. Safety"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.46586\/tosc.v2018.i3.265-289","volume":"2018","author":"M Hall-Andersen","year":"2018","unstructured":"Hall-Andersen, M., Vejre, P.S.: Generating graphs packed with paths estimation of linear approximations and differentials. IACR Trans. Symmetric Cryptol. 2018(3), 265\u2013289 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ress.2019.03.026","volume":"188","author":"J Kawahara","year":"2019","unstructured":"Kawahara, J., Sonoda, K., Inoue, T., Kasahara, S.: Efficient construction of binary decision diagrams for network reliability with imperfect vertices. Reliab. Eng. Syst. Safety 188, 142\u2013154 (2019)","journal-title":"Reliab. Eng. Syst. Safety"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s12095-015-0136-7","volume":"8","author":"O Kazymyrov","year":"2016","unstructured":"Kazymyrov, O., Oliynykov, R., Raddum, H.: Influence of addition modulo $$2^n$$ on algebraic attacks. Cryptogr. Commun. 8(2), 277\u2013289 (2016)","journal-title":"Cryptogr. Commun."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-46035-7_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"M Krause","year":"2002","unstructured":"Krause, M.: BDD-based cryptanalysis of keystream generators. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 222\u2013237. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_15"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10623-019-00673-2","volume":"88","author":"S K\u00f6lbl","year":"2020","unstructured":"K\u00f6lbl, S., Tischhauser, E., Derbez, P., Bogdanov, A.: Troika: a ternary cryptographic hash function. Designs Codes Cryptogr. 88(1), 91\u2013117 (2020)","journal-title":"Designs Codes Cryptogr."},{"unstructured":"Lind-Nielsen, J., Cohen, H., Gorogiannis, N.: Buddy (2014). https:\/\/sourceforge.net\/projects\/buddy\/","key":"9_CR21"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11814948_13","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"I Mironov","year":"2006","unstructured":"Mironov, I., Zhang, L.: Applications of SAT solvers to cryptanalysis of hash functions. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 102\u2013115. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_13"},{"doi-asserted-by":"publisher","unstructured":"Nyberg, K., knudsen, L.R.: Provable security against a differential attack. J. Cryptol. 8(1), 27\u201337 (1995). https:\/\/doi.org\/10.1007\/BF00204800","key":"9_CR23","DOI":"10.1007\/BF00204800"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-21356-9_4","volume-title":"Cryptography and Information Security in the Balkans","author":"H Raddum","year":"2015","unstructured":"Raddum, H., Kazymyrov, O.: Algebraic attacks using binary decision diagrams. In: Ors, B., Preneel, B. (eds.) BalkanCryptSec 2014. LNCS, vol. 9024, pp. 40\u201354. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21356-9_4"},{"issue":"1","key":"9_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10623-008-9180-z","volume":"49","author":"H Raddum","year":"2008","unstructured":"Raddum, H., Semaev, I.: Solving multiple right hand sides linear equations. Designs Codes Cryptogr. 49(1), 147\u2013160 (2008). https:\/\/doi.org\/10.1007\/s10623-008-9180-z","journal-title":"Designs Codes Cryptogr."},{"unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pp. 42\u201347. IEEE (1993)","key":"9_CR26"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-31912-9_2","volume-title":"Information Security and Cryptology - ICISC 2011","author":"TE Schilling","year":"2012","unstructured":"Schilling, T.E., Raddum, H.: Analysis of trivium using compressed\u00a0right\u00a0hand\u00a0side\u00a0equations. In: Kim, H. (ed.) ICISC 2011. LNCS, vol. 7259, pp. 18\u201332. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31912-9_2"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-30615-0_27","volume-title":"Sequences and Their Applications \u2013 SETA 2012","author":"TE Schilling","year":"2012","unstructured":"Schilling, T.E., Raddum, H.: Solving compressed right hand side equation systems with linear absorption. In: Helleseth, T., Jedwab, J. (eds.) SETA 2012. LNCS, vol. 7280, pp. 291\u2013302. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30615-0_27"},{"issue":"12","key":"9_CR29","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1109\/EE.1938.6431064","volume":"57","author":"CE Shannon","year":"1938","unstructured":"Shannon, C.E.: A symbolic analysis of relay and switching circuits. Electr. Eng. 57(12), 713\u2013723 (1938)","journal-title":"Electr. Eng."},{"unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0.0. https:\/\/github.com\/ivmai\/cudd","key":"9_CR30"},{"key":"9_CR31","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":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-77360-3_2","volume-title":"Selected Areas in Cryptography","author":"D Stegemann","year":"2007","unstructured":"Stegemann, D.: Extended BDD-based cryptanalysis of keystream generators. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 17\u201335. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77360-3_2"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81652-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T22:02:28Z","timestamp":1752962548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81652-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816513","9783030816520"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81652-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac2020.ca\/","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 (provided by the conference organizers)"}},{"value":"iChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - 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 (provided by the conference organizers)"}},{"value":"3-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}