CryptoMiniSat
From MaRDI portal
Cited in
(71)- Research on fault-tolerant algebraic fault attack on HIGHT
- A practical attack on patched MIFARE Classic
- Formal analysis of the entropy / security trade-off in first-order masking countermeasures against side-channel attacks
- Clause vivification by unit propagation in CDCL SAT solvers
- \(D_2\)-synchronization in nondeterministic automata
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
- Subsampling and knowledge distillation on adversarial examples: new techniques for deep learning based side channel evaluations
- Side-channel cryptographic attacks using pseudo-Boolean optimization
- Distributed cube and conquer with Paracooba
- Learning rate based branching heuristic for SAT solvers
- Efficient CNF simplification based on binary implication graphs
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- Stream/block ciphers, difference equations and algebraic attacks
- On conversions from CNF to ANF
- An algebraic attack to the Bluetooth stream cipher \textsc{E0}
- DRAT-based bit-vector proofs in CVC4
- Observations on the \textsf{SIMON} block cipher family
- Ranking with multiple reference points: efficient SAT-based learning procedures
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- A chosen IV related key attack on Grain-128a
- An expressive model for instance decomposition based parallel SAT solvers
- DPvis
- HaifaSat
- PolyBoRi
- Siege
- ApCoCoA
- Plingeling
- An empirical study of branching heuristics through the lens of global learning rate
- Glucose
- PrecoSAT
- HeerHugo
- GlueMiniSat
- antom
- Picoso
- PMiniSAT
- EPCBC
- iSat
- Coprocessor
- Spybug
- Approximate counting in SMT and value estimation for probabilistic programs
- satUZK
- abcdSAT
- MiFuMax
- pylgl
- MapleSAT
- MapleAmpharos
- Syrup
- Lingeling
- BooleForce
- Using SAT solvers for synchronization issues in non-deterministic automata
- Maple_LCM_Dist_ChronoBT
- Sparrow2Riss
- Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
- An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples
- Extreme cases in SAT problems
- Constraints for symmetry breaking in graph representation
- Soundness of inprocessing in clause sharing SAT solvers
- Algorithm runtime prediction: methods \& evaluation
- SpyBug: automated bug detection in the configuration space of SAT solvers
- The configurable SAT solver challenge (CSSC)
- An overview of parallel SAT solving
- Reformulation based MaxSat robustness
- PySAT: a Python toolkit for prototyping with SAT oracles
- DRAT proofs for XOR reasoning
- Observing biases in the state: case studies with Trivium and Trivia-SC
- Model counting with error-correcting codes
- Solving a binary puzzle
- A preimage attack on reduced \textsc{Gimli}-\textsc{Gash}
- Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model
- A signature based border basis algorithm
This page was built for software: CryptoMiniSat
