Using SAT solvers in large scale distributed algebraic attacks against low entropy keys
Hromada, Viliam ; Öllös, Ladislav ; Zajac, Pavol
Tatra Mountains Mathematical Publications, Tome 62 (2015), / Harvested from Mathematical Institute
Link
Link

In this paper we study large scale distributedIn this paper we study large scale distributed algebraic attackswith SAT solvers in a specific scenarios. We are interested in the complexity of finding low entropy keys with the help of SAT solvers. Moreover, we examine how to efficiently distribute this process on multiple computing nodes. Finally, we show that the average cost of the attack per key decreases, if the attacker has access to many different encryptions with different keys.

Publié le : 2015-01-01
DOI : https://doi.org/10.2478/tatra.v64i0.379 
@article{379,
     title = {Using SAT solvers in large scale distributed algebraic attacks against low entropy keys},
     journal = {Tatra Mountains Mathematical Publications},
     volume = {62},
     year = {2015},
     doi = {10.2478/tatra.v64i0.379},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/379}
}

Hromada, Viliam; Öllös, Ladislav; Zajac, Pavol. Using SAT solvers in large scale distributed algebraic attacks against low entropy keys. Tatra Mountains Mathematical Publications, Tome 62 (2015) . doi : 10.2478/tatra.v64i0.379. http://gdmltest.u-ga.fr/item/379/