Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Zaikin, Oleg"'
Autor:
Zaikin, Oleg
MD4 and MD5 are seminal cryptographic hash functions proposed in early 1990s. MD4 consists of 48 steps and produces a 128-bit hash given a message of arbitrary finite size. MD5 is a more secure 64-step extension of MD4. Both MD4 and MD5 are vulnerabl
Externí odkaz:
http://arxiv.org/abs/2212.02405
Autor:
Jędrzejewski, Arkadiusz, Toruniewska, Joanna, Suchecki, Krzysztof, Zaikin, Oleg, Hołyst, Janusz A.
Publikováno v:
Phys. Rev. E 102, 042313 (2020)
We study an adaptive network model driven by a nonlinear voter dynamics. Each node in the network represents a voter and can be in one of two states that correspond to different opinions shared by the voters. A voter disagreeing with its neighbor's o
Externí odkaz:
http://arxiv.org/abs/2004.08927
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 1 (March 2, 2020) lmcs:4525
In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis. We describe how cryptanalysis problems are reduced to SA
Externí odkaz:
http://arxiv.org/abs/1805.07239
Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number of practical applications of SAT can only be tackled efficiently by i
Externí odkaz:
http://arxiv.org/abs/1803.04646
Publikováno v:
In IFAC PapersOnLine 2022 55(10):1787-1792
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit arithmetic
Externí odkaz:
http://arxiv.org/abs/1709.02599
In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers. We implemented this technology in the form o
Externí odkaz:
http://arxiv.org/abs/1607.00888
Autor:
Semenov, Alexander, Zaikin, Oleg
Publikováno v:
LNCS 9251 (2015) 222-230
In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can c
Externí odkaz:
http://arxiv.org/abs/1507.00862
In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability problem (SAT). We believe that this project can be a useful tool for com
Externí odkaz:
http://arxiv.org/abs/1411.5433