The initial question is obvious: what did Kondrak and Hauer actually do to try to crack the Voynich’s mysterious secrets that (they thought) nobody else had tried before? A quick snoop reveals that Bradley Hauer is a pretty smart crypto cookie: the simple substitution cipher solver presented...
1.1Clustering trails by solver For the optimal 7-round differential trail listed in Table15, we fix the input and output differences in the search program and enumerate the number of trails within this differential by the SAT solver [65]. The clustering result indicates that the differential effe...
In the first case, the Boolean equations are transformed into a conjunctive normal form (CNF) formula, whose satisfying assignment/s are found with a SAT solver. In the second case, the problem of searching for 294 A. Biryukov et al. trails is effectively transformed into a mixed-integer ...