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