The following pages link to CryptoMiniSat (Q22051):
Displayed 43 items.
- An overview of parallel SAT solving (Q487635) (← links)
- Reformulation based MaxSat robustness (Q487654) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Observing biases in the state: case studies with Trivium and Trivia-SC (Q510484) (← links)
- Stream/block ciphers, difference equations and algebraic attacks (Q820950) (← links)
- Subsampling and knowledge distillation on adversarial examples: new techniques for deep learning based side channel evaluations (Q832386) (← links)
- An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples (Q1652706) (← links)
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Solving a binary puzzle (Q1701670) (← links)
- Model counting with error-correcting codes (Q2009186) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- An algebraic attack to the Bluetooth stream cipher \textsc{E0} (Q2081340) (← links)
- A preimage attack on reduced \textsc{Gimli}-\textsc{Gash} (Q2104439) (← links)
- Ranking with multiple reference points: efficient SAT-based learning procedures (Q2108155) (← links)
- DRAT-based bit-vector proofs in CVC4 (Q2181940) (← links)
- A signature based border basis algorithm (Q2183746) (← links)
- Clause vivification by unit propagation in CDCL SAT solvers (Q2287199) (← links)
- On conversions from CNF to ANF (Q2307626) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking (Q2398438) (← links)
- Side-channel cryptographic attacks using pseudo-Boolean optimization (Q2398519) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Distributed cube and conquer with Paracooba (Q2661340) (← links)
- Extreme Cases in SAT Problems (Q2818004) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers (Q2818043) (← links)
- DRAT Proofs for XOR Reasoning (Q2835888) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- Formal Analysis of the Entropy / Security Trade-off in First-Order Masking Countermeasures against Side-Channel Attacks (Q3104720) (← links)
- (Q3175285) (← links)
- A Practical Attack on Patched MIFARE Classic (Q3454151) (← links)
- Observations on the SIMON Block Cipher Family (Q3457109) (← links)
- Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model (Q4649773) (← links)
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC (Q4922044) (← links)
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers (Q4922900) (← links)
- Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages (Q5015592) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- A Chosen IV Related Key Attack on Grain-128a (Q5300933) (← links)
- Soundness of Inprocessing in Clause Sharing SAT Solvers (Q5326451) (← links)