<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></abstract>

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.

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

Institute of Computer Science and Mathematics Faculty of Electrical Engineering and Information Technology Slovak University of Technology in Bratislava Ilkovičova 3, SK-812-19 Bratislava SLOVAKIA

Tatra Mountains Mathematical Publications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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...

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

Published Online: Feb 19, 2016

Page range: 187 - 203

DOI: https://doi.org/10.1515/tmmp-2015-0048

© 2016

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.