Research map / Adversarial robustness and security / Backdoor and poisoning
On Cryptographic Attacks Using Backdoors for SAT
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the IBS-based attack instead of the previous best attack | Reduced-round Trivium cryptanalysis · Trivium, 288-bit initial state, 300-bit keystream | estimated attack time (seconds): $2.50\mathrm{e}{+34}$ -> $2.04\mathrm{e}{+41}$ | Hurt |
| Use the IBS-based attack instead of the previous best attack | Reduced-round AES-128 cryptanalysis · AES-128, 2.5 rounds, 3KP | estimated attack time (seconds): $3.08\mathrm{e}{+16}$ -> $1.45\mathrm{e}{+15}$ | Helped |
| Use the IBS-based attack instead of the previous best attack | Reduced-round Magma cryptanalysis · Magma, 8 rounds, 12KP | estimated attack time (seconds): $1.17\mathrm{e}{+23}$ -> $3.55\mathrm{e}{+22}$ | Helped |
Closest papers by meaning
- Faster Algorithms for Weak Backdoors (AAAI 2022 · similarity 0.89)
- On Probabilistic Generalization of Backdoors in Boolean Satisfiability (AAAI 2022 · similarity 0.89)
- Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation (NeurIPS 2024 · similarity 0.85)
- Can Transformers Reason Logically? A Study in SAT Solving (ICML 2025 · similarity 0.84)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.81)
- NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks (ICLR 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.