The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Extending SAT Solvers to Cryptographic Problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Courtois, N. T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_11 · Cited by 904
A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 )
Faugère, J. C. (2002) · Proceedings of the 2002 international symposium on Symbolic and algebraic computation · doi:10.1145/780506.780516 · Cited by 785
Temporal Induction by Incremental SAT Solving
Eén, N., & Sörensson, N. (2003) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)82542-3 · Cited by 382
Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
De Cannière, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11836810_13 · Cited by 270
Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
Cannière, C. D. (2006) · Lirias · Cited by 197
Garcia, F. D., de Koning Gans, G., Muijrers, R., van Rossum, P., Verdult, R., Schreur, R. W., & Jacobs, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_7 · Cited by 194
Research works printed but not linked: 4
- Marques, J.P., Karem, S., Sakallah, A.: Conflict analysis in search algorithms for propositional satisfiability. In: Proc. of the IEEE Intl. Conf. on Tools with Artificial Intelligence (1996)
- Faugère, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In: ISSAC 2002, pp. 75–83. ACM Press, New York (2002)
- Li, C.M.: Equivalency reasoning to solve a class of hard SAT problems. Information Processing Letters 75(1-2), 75–81 (1999) · doi:10.1016/s0020-0190(00)00126-5
- Sinz, C.: Visualizing SAT instances and runs of the DPLL algorithm. J. Autom. Reason. 39(2), 219–243 (2007) · doi:10.1007/s10817-007-9074-1
Cited by
Efficient Exact Verification of Binarized Neural Networks
Jia, K., & Rinard, M. (2020) · arXiv · doi:10.48550/arxiv.2005.03597 · Cited by 33
Decoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
Evidence of scaling advantage on an NP-complete problem with enhanced quantum solvers
Lu, Q., Wei, S., Li, K., Gao, P., Yan, B., Zheng, M., Zhang, H., Zeng, J., & Long, G.-L. (2026) · Nature Computational Science · doi:10.1038/s43588-026-01007-8 · Cited by 1
“The Boolean satisfiability problem (SAT) is a central topic in computer science, combinatorics and logic, with broad applications spanning model checking 13–16 , combinatorial optimization 17–19 , automated deduction 20,21 and cryptography 22–25 .”
Metadata
- Authors
- Soos, M., Nohl, K., & Castelluccia, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 244-257
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1605798759
- Cited by
- 484
- References
- 13
- FWCI
- 12.69
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Extending SAT Solvers to Cryptographic Problems. https://app.cochat.ai/papers/10.1007/978-3-642-02777-2_24
- The paper
- Soos, M., Nohl, K., & Castelluccia, C. (2009). Extending SAT Solvers to Cryptographic Problems. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-02777-2_24
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
