Using SAT solvers in large scale distributed algebraic attacks against low entropy keys

In: Tatra Mountains Mathematical Publications, vol. 64, no. 3

Viliam Hromada - Ladislav Öllős - Pavol Zajac

Detaily:

Rok, strany: 2015, 187 - 203

Kľúčové slová:

algebraic cryptanalysis, SAT solvers, DES, distributed computing

O článku:

In this paper we study large scale distributed algebraic attacks with 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.

Ako citovať:

ISO 690:

Hromada, V., Öllős, L., Zajac, P. 2015. Using SAT solvers in large scale distributed algebraic attacks against low entropy keys. In Tatra Mountains Mathematical Publications, vol. 64, no.3, pp. 187-203. 1210-3195.

APA:

Hromada, V., Öllős, L., Zajac, P. (2015). Using SAT solvers in large scale distributed algebraic attacks against low entropy keys. Tatra Mountains Mathematical Publications, 64(3), 187-203. 1210-3195.