Skip to main content

Table 1 Decomposition sets for SAT-based cryptanalysis of A5/1 and corresponding values of the predictive function

From: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions

Set

Power of set

\(F\left( \cdot \right)\)

\(S_1\)

31

4.45140e+08

\(S_2\)

31

4.78318e+08

\(S_3\)

32

4.64428e+08