Solving cryptanalysis instances for A5/1 in the volunteer computing project SAT@home The values of predictive function presented in Table 1 show that the SAT-based cryptanalysis of the A5/1 generator requires quite significant computing power.
← all excerpts
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.
1
—
—