{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:06:29Z","timestamp":1766268389110,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2021-03089"],"award-info":[{"award-number":["RGPIN-2021-03089"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669712","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"391-399","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["SAT and Lattice Reduction for Integer Factorization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8180-9807","authenticated-orcid":false,"given":"Yameen","family":"Ajani","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Windsor, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0462-625X","authenticated-orcid":false,"given":"Curtis","family":"Bright","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Windsor, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756636"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055282.3055285"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, SC-Square@ISSAC","author":"Ajani Yameen","year":"2023","unstructured":"Yameen Ajani and Curtis Bright. 2023. A Hybrid SAT and Lattice Reduction Approach for Integer Factorization. In Proceedings of the 8th SC-Square Workshop co-located with the 48th International Symposium on Symbolic and Algebraic Computation, SC-Square@ISSAC 2023, Troms\u00f8, Norway, July 28, 2023(CEUR Workshop Proceedings, Vol.\u00a03455), Erika \u00c1brah\u00e1m and Thomas Sturm (Eds.). CEUR-WS.org, 39\u201343. https:\/\/ceur-ws.org\/Vol-3455\/short1.pdf"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 9th SC-Square Workshop, Daniela Kaufmann and Chris Brown (Eds.). To appear.","author":"Alamgir Nahiyan","year":"2024","unstructured":"Nahiyan Alamgir, Saeed Nejati, and Curtis Bright. 2024. SHA-256 Collision Attack with Programmatic SAT. In Proceedings of the 9th SC-Square Workshop, Daniela Kaufmann and Chris Brown (Eds.). To appear."},{"volume-title":"Attacking RSA moduli with SAT solvers. Bachelors\u2019s Thesis","author":"Asketorp Jonatan","key":"e_1_3_2_1_5_1","unstructured":"Jonatan Asketorp. 2014. Attacking RSA moduli with SAT solvers. Bachelors\u2019s Thesis, KTH Royal Institute of Technology."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Armin Biere Marijn Heule Hans van Maaren and Toby Walsh (Eds.). 2021. Handbook of Satisfiability. IOS Press. https:\/\/doi.org\/10.3233\/faia336","DOI":"10.3233\/faia336"},{"key":"e_1_3_2_1_7_1","first-page":"203","article-title":"Twenty years of attacks on the RSA cryptosystem","volume":"46","author":"Boneh Dan","year":"1999","unstructured":"Dan Boneh. 1999. Twenty years of attacks on the RSA cryptosystem. Notices of the AMS 46, 2 (1999), 203\u2013213.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49649-1_3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011435"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45641-6_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3500921"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/0025570x.1980.11976835"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/035\/01"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900030"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.07.017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.62056\/ahjbksdja"},{"key":"e_1_3_2_1_17_1","volume-title":"SC-Square: Overview to","author":"England Matthew","year":"2021","unstructured":"Matthew England. 2022. SC-Square: Overview to 2021. In Proceedings of the Sixth International Workshop on Satisfiability Checking and Symbolic Computation, Curtis Bright and James Davenport (Eds.). CEUR-WS.org, 1\u20136. https:\/\/ceur-ws.org\/Vol-3273\/invited1.pdf"},{"volume-title":"A comparison of reductions from FACT to CNF-SAT. Bachelors\u2019s Thesis","author":"Eriksson Jan","key":"e_1_3_2_1_18_1","unstructured":"Jan Eriksson and Jonas H\u00f6glund. 2014. A comparison of reductions from FACT to CNF-SAT. Bachelors\u2019s Thesis, KTH Royal Institute of Technology."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SAT.2023.8"},{"volume-title":"Factoring integers with parallel SAT solvers. Bachelors\u2019s Thesis","author":"Forsblom Erik","key":"e_1_3_2_1_20_1","unstructured":"Erik Forsblom and Daniel Lund\u00e9n. 2015. Factoring integers with parallel SAT solvers. Bachelors\u2019s Thesis, KTH Royal Institute of Technology."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_12"},{"key":"e_1_3_2_1_23_1","volume-title":"GNU MP: The GNU Multiple Precision Arithmetic Library (5.0.5 ed.)","author":"Granlund Torbj\u00f6rn","year":"2012","unstructured":"Torbj\u00f6rn Granlund and the GMP development team. 2012. GNU MP: The GNU Multiple Precision Arithmetic Library (5.0.5 ed.). http:\/\/gmplib.org\/."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1506409.1506429"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v34i2.2450"},{"key":"e_1_3_2_1_26_1","volume-title":"FLINT: Fast Library for Number Theory. Version 2.9.0, https:\/\/flintlib.org.","author":"Hart W.","year":"2013","unstructured":"W. Hart, F. Johansson, and S. Pancratz. 2013. FLINT: Fast Library for Number Theory. Version 2.9.0, https:\/\/flintlib.org."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_25"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12209"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2020.10.003"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0024458"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-022-00688-6"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SAT.2023.14"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","unstructured":"Arjen\u00a0K. Lenstra and Hendrik\u00a0W. Lenstra (Eds.). 1993. The development of the number field sieve. Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/bfb0091534","DOI":"10.1007\/bfb0091534"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01457454"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 7th SC-Square Workshop","author":"Li Zhengyu","year":"2022","unstructured":"Zhengyu Li, Curtis Bright, and Vijay Ganesh. 2022. An SC-Square Approach to the Minimum Kochen\u2013Specker Problem. In Proceedings of the 7th SC-Square Workshop, Haifa, Israel, August 12, 2022(CEUR Workshop Proceedings, Vol.\u00a03458), Ali\u00a0Kemal Uncu and Haniel Barbosa (Eds.). CEUR-WS.org, 55\u201366. https:\/\/ceur-ws.org\/Vol-3458\/paper6.pdf"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/isvlsi.2018.00071"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/iccad.1996.569607"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_13"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108854207.006"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-11687-7"},{"key":"e_1_3_2_1_44_1","unstructured":"Constantinos Patsakis. 2013. RSA private key reconstruction from random bits using SAT solvers. Cryptology ePrint Archive Paper 2013\/026. https:\/\/eprint.iacr.org\/2013\/026"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204018"},{"key":"e_1_3_2_1_46_1","unstructured":"Paul Purdom and Amr Sabry. 2003. CNF Generator for Factoring Problems. https:\/\/cgi.luddy.indiana.edu\/\u00a0sabry\/cnf.html."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45204-8_26"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","unstructured":"Jarkko Savela Emilia Oikarinen and Matti J\u00e4rvisalo. 2020. Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. In EPiC Series in Computing. EasyChair 465\u2013482. https:\/\/doi.org\/10.29007\/k8jd","DOI":"10.29007\/k8jd"},{"key":"e_1_3_2_1_50_1","volume-title":"Satisfy This: An Attempt at Solving Prime Factorization using Satisfiability Solvers. Technical report","author":"Schoenmackers Stefan","year":"2004","unstructured":"Stefan Schoenmackers and Anna Cavender. 2004. Satisfy This: An Attempt at Solving Prime Factorization using Satisfiability Solvers. Technical report, University of Washington."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0036144598347011"},{"issue":"4","key":"e_1_3_2_1_52_1","first-page":"4","article-title":"fplll, a lattice reduction library","volume":"5","author":"The","year":"2023","unstructured":"The fplll development team. 2023. fplll, a lattice reduction library, Version: 5.4.4. (2023). Available at https:\/\/github.com\/fplll\/fplll.","journal-title":"Version"},{"key":"e_1_3_2_1_53_1","unstructured":"The Sage Developers. 2024. SageMath the Sage Mathematics Software System. https:\/\/www.sagemath.org"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54970-4_19"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139856065"},{"key":"e_1_3_2_1_57_1","unstructured":"Henry Yuen and Joseph Bebel. 2011. ToughSAT Generation. https:\/\/toughsat.appspot.com\/"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9396-y"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_41"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:52:23Z","timestamp":1758588743000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":59,"alternative-id":["10.1145\/3666000.3669712","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669712","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}