Local reduction methods can be used to assess the resistance ofcryptosystems against algebraic attacks. The assessment is based on the separationof the attack into polynomial-time reduction algorithm, and exponentialtime guessing and backtracking. This approach is similar to that employed bythe DPLL algorithm that is used as a core of various modern SAT-solvers. In thearticle we show the application of this method to evaluate the strength of (reducedversions of) two chosen SHA-3 candidates: JH, and Keccak, respectively.We compare the complexity estimates with the behavior of the full search algorithm.We also compare the results based on the local reduction with the attackbased on the use of SAT-solvers PrecoSAT, and CryptoMiniSAT, respectively.
@article{203,
title = {A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak},
journal = {Tatra Mountains Mathematical Publications},
volume = {51},
year = {2012},
doi = {10.2478/tatra.v53i0.203},
language = {EN},
url = {http://dml.mathdoc.fr/item/203}
}
Adamček, Peter; Loderer, Marek; Zajac, Pavol. A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak. Tatra Mountains Mathematical Publications, Tome 51 (2012) . doi : 10.2478/tatra.v53i0.203. http://gdmltest.u-ga.fr/item/203/