{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:49:25Z","timestamp":1768531765832,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_45","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"774-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parity (XOR) Reasoning for the Index Calculus Attack"],"prefix":"10.1007","author":[{"given":"Monika","family":"Trimoska","sequence":"first","affiliation":[]},{"given":"Sorina","family":"Ionica","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Dequen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"45_CR1","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 399\u2013404 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/074.pdf"},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/JMC.2009.009","volume":"3","author":"L Bettale","year":"2009","unstructured":"Bettale, L., Faug\u00e8re, J., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. J. Math. Cryptol. 3(3), 177\u2013197 (2009). https:\/\/doi.org\/10.1515\/JMC.2009.009","journal-title":"J. Math. Cryptol."},{"key":"45_CR3","unstructured":"Biere, A.: CaDiCaL simplified satisfiability solver. http:\/\/fmv.jku.at\/cadical\/. Accessed 27 May 2020"},{"key":"45_CR4","unstructured":"BlueKrypt: Cryptographic key length recommendation (2018). https:\/\/www.keylength.com. Accessed 27 May 2020"},{"issue":"3\u20134","key":"45_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symb. Comput."},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-15031-9_14","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"C Bouillaguet","year":"2010","unstructured":"Bouillaguet, C., et al.: Fast exhaustive search for polynomial systems in $${\\mathbb{F}_2}$$. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 203\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_14"},{"key":"45_CR7","doi-asserted-by":"publisher","unstructured":"Choo, D., Soos, M., Chai, K.M.A., Meel, K.S.: Bosphorus: bridging ANF and CNF solvers. In: Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, 25\u201329 March 2019, pp. 468\u2013473 (2019). https:\/\/doi.org\/10.23919\/DATE.2019.8715061","DOI":"10.23919\/DATE.2019.8715061"},{"issue":"7","key":"45_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962). https:\/\/doi.org\/10.1145\/368273.368557","journal-title":"Commun. ACM"},{"key":"45_CR9","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"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C Diem","year":"2011","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves. Compositio Mathematica 147(1), 75\u2013104 (2011). https:\/\/doi.org\/10.1112\/S0010437X10005075","journal-title":"Compositio Mathematica"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"issue":"1\u20133","key":"45_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/780506.780516","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner basis (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999). https:\/\/doi.org\/10.1145\/780506.780516","journal-title":"J. Pure Appl. Algebra"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29011-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J-C Faug\u00e8re","year":"2012","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 27\u201344. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_4"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-13039-2_24","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"SD Galbraith","year":"2014","unstructured":"Galbraith, S.D., Gebregiyorgis, S.W.: Summation polynomial algorithms for elliptic curves in characteristic two. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 409\u2013427. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_24"},{"issue":"12","key":"45_CR15","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P Gaudry","year":"2009","unstructured":"Gaudry, P.: Index calculus for Abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput. 44(12), 1690\u20131702 (2009). https:\/\/doi.org\/10.1016\/j.jsc.2008.08.005","journal-title":"J. Symb. Comput."},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ipl.2018.07.001","volume":"139","author":"D G\u00e9rault","year":"2018","unstructured":"G\u00e9rault, D., Lafourcade, P., Minier, M., Solnon, C.: Revisiting AES related-key differential attacks with constraint programming. Inf. Process. Lett. 139, 24\u201329 (2018). https:\/\/doi.org\/10.1016\/j.ipl.2018.07.001","journal-title":"Inf. Process. Lett."},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"103183","DOI":"10.1016\/j.artint.2019.103183","volume":"278","author":"D Gerault","year":"2020","unstructured":"Gerault, D., Lafourcade, P., Minier, M., Solnon, C.: Computing AES related-key differential characteristics with constraint programming. Artif. Intell. 278, 103183 (2020). https:\/\/doi.org\/10.1016\/j.artint.2019.103183","journal-title":"Artif. Intell."},{"key":"45_CR18","doi-asserted-by":"publisher","unstructured":"Gerault, D., Minier, M., Solnon, C.: Using constraint programming to solve a cryptanalytic problem. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 4844\u20134848. ijcai.org (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/679","DOI":"10.24963\/ijcai.2017\/679"},{"key":"45_CR19","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1986","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)"},{"key":"45_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-66158-2_13","volume-title":"Principles and Practice of Constraint Programming","author":"F Liu","year":"2017","unstructured":"Liu, F., Cruz, W., Ma, C., Johnson, G., Michel, L.: A tolerant algebraic side-channel attack on AES using CP. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 189\u2013205. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_13"},{"key":"45_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-98334-9_18","volume-title":"Principles and Practice of Constraint Programming","author":"F Liu","year":"2018","unstructured":"Liu, F., Cruz, W., Michel, L.: A complete tolerant algebraic side-channel attack for AES with CP. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 259\u2013275. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_18"},{"key":"45_CR22","unstructured":"van Maaren, H., Franco, J.: The International SAT Competition Web Page. http:\/\/www.satcompetition.org\/. Accessed 27 May 2020"},{"key":"45_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-94144-8_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Nadel","year":"2018","unstructured":"Nadel, A., Ryvchin, V.: Chronological backtracking. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 111\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_7"},{"key":"45_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-34961-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"C Petit","year":"2012","unstructured":"Petit, C., Quisquater, J.-J.: On polynomial systems arising from a weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 451\u2013466. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_28"},{"key":"45_CR25","unstructured":"Semaev, I.A.: Summation polynomials and the discrete logarithm problem on elliptic curves. IACR Cryptology ePrint Archive 2004, 31 (2004). http:\/\/eprint.iacr.org\/2004\/031"},{"key":"45_CR26","unstructured":"Soos, M.: Grain of salt \u2013 an automated way to test stream ciphers through SAT solvers. In: Tools\u201910: The Workshop on Tools for Cryptanalysis 2010, London, United Kingdom, pp. 131\u2013144, June 2010. https:\/\/hal.archives-ouvertes.fr\/hal-01288922"},{"key":"45_CR27","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":"45_CR28","unstructured":"Trimoska, M., Ionica, S., Dequen, G.: EC index calculus benchmarks (2020). https:\/\/github.com\/mtrimoska\/EC-Index-Calculus-Benchmarks"},{"key":"45_CR29","unstructured":"Trimoska, M., Ionica, S., Dequen, G.: WDSat solver (2020). https:\/\/github.com\/mtrimoska\/WDSat"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:41:11Z","timestamp":1619242871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","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":"55","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":"45% - 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.13","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":"3.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}