scientific article; zbMATH DE number 7199588
From MaRDI portal
Publication:5109519
Ilya Otpuschennikov, Irina Gribanova, Stepan Kochemazov, Oleg Sergeevich Zaikin, Aleksandr Anatol'evich Semënov
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1805.07239
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
On black-box optimization in divide-and-conquer SAT solving ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ Unnamed Item ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating circuit-level simplifications on CNF
- Optimising Gröbner bases on Bivium
- Formalization and implementation of modern SAT solvers
- Random sequence generation by cellular automata
- Chronological backtracking
- ALIAS: a modular tool for finding backdoors for SAT
- PySAT: a Python toolkit for prototyping with SAT oracles
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Limitations of restricted branching in clause learning
- Learning Rate Based Branching Heuristic for SAT Solvers
- Freestart Collision for Full SHA-1
- Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System
- URSA: A System for Uniform Reduction to SAT
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Attacking Bivium Using SAT Solvers
- Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles
- New Message Difference for MD4
- MD4 is Not One-Way
- Algebraic Cryptanalysis
- Inversion Attacks on Secure Hash Functions Using sat Solvers
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Symbolic execution and program testing
- GRASP: a search algorithm for propositional satisfiability
- The First Two Rounds of MD4 are Not One-Way
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Contradiction Immunity and Guess-Then-Determine Attacks on Gost
- Combining Symmetry Breaking and Global Constraints
- Automatic Search of Attacks on Round-Reduced AES and Applications
- Tools and Algorithms for the Construction and Analysis of Systems
- Software Verification for Weak Memory via Program Transformation
- How to Break MD5 and Other Hash Functions
- Algebraic Cryptanalysis of the Data Encryption Standard
- Frontiers of Combining Systems
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- The Monte Carlo Method
- Computational Complexity
This page was built for publication:
