Skip to main content

Table 3 Solving cryptanalysis problems for Bivium and Grain on a computing cluster

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

Problem

\(\left| \tilde{X}_{best}\right|\)

\(F_{best}\)

\(\Delta _C(\tilde{X}_{best})\) on 480 cores

Finding SAT on 480 cores

1 core

480 cores

inst. 1

inst. 2

inst. 3

inst. 1

inst. 2

inst. 3

Bivium16

31

1.65e7

3.44e4

3.42e4

3.36e4

3.42e4

1.10e3

2.33e4

2.67e4

Bivium14

35

6.84e7

1.42e4

1.34e5

1.32e5

1.33e5

3.95e2

9.10e4

9.18e4

Bivium12

37

2.63e8

5.50e5

4.95e5

4.83e5

5.28e5

3.04e5

1.39e5

1.89e5

Grain44

29

1.60e7

3.36e4

3.61e4

4.51e4

3.73e4

1.34e3

1.35e4

8.24e2

Grain42

29

6.05e7

1.26e5

1.35e5

1.30e5

1.20e5

6.92e4

1.07e5

9.15e4

Grain40

32

2.52e8

5.27e5

5.79e5

5.73e5

5.06e5

3.10e5

5.10e5

3.20e5