CryptoMiniSat
From MaRDI portal
Software:22051
swMATH10082MaRDI QIDQ22051FDOQ22051
Author name not available (Why is that?)
Cited In (43)
- Soundness of Inprocessing in Clause Sharing SAT Solvers
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- Stream/block ciphers, difference equations and algebraic attacks
- Title not available (Why is that?)
- Subsampling and knowledge distillation on adversarial examples: new techniques for deep learning based side channel evaluations
- Distributed cube and conquer with Paracooba
- A Practical Attack on Patched MIFARE Classic
- Ranking with multiple reference points: efficient SAT-based learning procedures
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Learning Rate Based Branching Heuristic for SAT Solvers
- A Chosen IV Related Key Attack on Grain-128a
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
- Algorithm runtime prediction: methods \& evaluation
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
- Model counting with error-correcting codes
- On conversions from CNF to ANF
- Constraints for symmetry breaking in graph representation
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- DRAT-based bit-vector proofs in CVC4
- Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model
- Extreme Cases in SAT Problems
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
- Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages
- Observations on the SIMON Block Cipher Family
- An overview of parallel SAT solving
- Reformulation based MaxSat robustness
- An empirical study of branching heuristics through the lens of global learning rate
- Approximate counting in SMT and value estimation for probabilistic programs
- Side-channel cryptographic attacks using pseudo-Boolean optimization
- Formal Analysis of the Entropy / Security Trade-off in First-Order Masking Countermeasures against Side-Channel Attacks
- Using SAT solvers for synchronization issues in non-deterministic automata
- Clause vivification by unit propagation in CDCL SAT solvers
- Efficient CNF Simplification Based on Binary Implication Graphs
- A signature based border basis algorithm
- The configurable SAT solver challenge (CSSC)
- DRAT Proofs for XOR Reasoning
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- Observing biases in the state: case studies with Trivium and Trivia-SC
- Solving a binary puzzle
- PySAT: a Python toolkit for prototyping with SAT oracles
- An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples
- A preimage attack on reduced \textsc{Gimli}-\textsc{Gash}
This page was built for software: CryptoMiniSat