|
|
|
Oleg Zaikin,Stepan Kochemazov
Pág. 5 - 10
Many state-of-the-art algorithms for solving Boolean satisfiability problem (SAT) are based on the CDCL algorithm. CDCL generates a lot of so-called conflict clauses that correspond to traversed branches of a tree of possible solutions. To maintain high ...
ver más
|
|
|
|
|
|
|
Oleg Zaikin
Pág. 29 - 33
In this study, shrinking and self-shrinking keystream generators are analyzed. These generators can be used in stream ciphering. For each generator the following cryptanalysis problem was considered: given a known keystream fragment, find the correspondi...
ver más
|
|
|
|
|
|
|
Oleg Zaikin, Anatoly Korablin, Nadia Dyulger, Nikolai Barnenkov
Pág. 717 - 723
This article contains the results of statistical research of velocity restitution coefficient variations when a motor car hits a concrete wall during crash tests performed by different researchers, for the purpose of deriving an equation of the relations...
ver más
|
|
|
|