1. Building Bridges between Symbolic Computation and Satisfiability Checking
2. Satisfiability checking and symbolic computation
3. 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ø, Norway, July 28, 2023(CEUR Workshop Proceedings, Vol. 3455), Erika Ábrahám and Thomas Sturm (Eds.). CEUR-WS.org, 39–43. https://ceur-ws.org/Vol-3455/short1.pdf
4. 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.
5. Jonatan Asketorp. 2014. Attacking RSA moduli with SAT solvers. Bachelors’s Thesis, KTH Royal Institute of Technology.