CryptoMiniSat

swMATH10082MaRDI QIDQ22051FDOQ22051

Author name not available (Why is that?)

Cited In (43)

• Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
• Stream/block ciphers, difference equations and algebraic attacks
• Subsampling and knowledge distillation on adversarial examples: new techniques for deep learning based side channel evaluations
• Distributed cube and conquer with Paracooba
• Ranking with multiple reference points: efficient SAT-based learning procedures
• Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
• Algorithm runtime prediction: methods \& evaluation
• Model counting with error-correcting codes
• Extreme cases in SAT problems
• Observations on the \textsf{SIMON} block cipher family
• On conversions from CNF to ANF
• An expressive model for instance decomposition based parallel SAT solvers
• Soundness of inprocessing in clause sharing SAT solvers
• 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
• Research on fault-tolerant algebraic fault attack on HIGHT
• Formal analysis of the entropy / security trade-off in first-order masking countermeasures against side-channel attacks
• Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model
• Efficient CNF simplification based on binary implication graphs
• A chosen IV related key attack on Grain-128a
• Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
• \(D_2\)-synchronization in nondeterministic automata
• DRAT proofs for XOR reasoning
• 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
• Using SAT solvers for synchronization issues in non-deterministic automata
• A practical attack on patched MIFARE Classic
• Clause vivification by unit propagation in CDCL SAT solvers
• A signature based border basis algorithm
• The configurable SAT solver challenge (CSSC)
• 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
• Learning rate based branching heuristic for SAT solvers
• An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples
• SpyBug: automated bug detection in the configuration space of SAT solvers
• A preimage attack on reduced \textsc{Gimli}-\textsc{Gash}
• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages

This page was built for software: CryptoMiniSat