Extending SAT Solvers to Cryptographic Problems
By Mate Soos, Karsten Nohl, Claude Castelluccia. International Conference on Theory and Applications of Satisfiability Testing, 2009
605 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/fbae47bf980dd14adc0dea81ec3dbf90a8aa67c9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Alexey Ignatiev
- Joao Marques-Silva
- António Morgado
- Stefano Ermon
- Ashish Sabharwal
- Carla P. Gomes
- Sharad Malik
- Pramod Subramanyan
In Computational Theory and Mathematics
- Joao Marques-Silva
- Alexey Ignatiev
- António Morgado
- Ashish Sabharwal
- Carla P. Gomes
- Sharad Malik
- Pramod Subramanyan
- Bart Selman
In Electrical and Electronic Engineering
- Joao Marques-Silva
- Sharad Malik
- Alexey Ignatiev
- Pramod Subramanyan
- António Morgado
- Sayak Ray
- Stefano Ermon
- Ashish Sabharwal
Citations in the corpus
- Embed and Project: Discrete Sampling with Universal Hashing (2013, methodology): “Table 2a summarizes the results obtained using the propositional satisfiability (SAT) solver CryptoMiniSAT [21] as the feasibility query oracle for PAWS.”
- PySAT: A Python Toolkit for Prototyping with SAT Oracles (2018, methodology): “These include PyMiniSolvers [40] providing an interface to MiniSat and MiniCard, satispy [44] providing an API for MiniSat and lingeling, pylgl [39] for working with lingeling, and the Python API for CryptoMiniSat [12, 49, 50].”
- Evaluating the security of logic encryption algorithms (2015, methodology): “XOR/XNOR gates result in clauses that are harder to satisfy with the DPLL algorithm used in modern SAT solvers [21].”