Mobile Architecture for Distributed Brute-Force Attacks


  • Alexandru Marculescu The Bucharest University of Economic Studies


brute-force attack, distributed computing, smartphones


The focus of this paper centers on demonstrating that a distributed brute-force search of even a medium key-sized cryptosystem’s keyspace is possible even using the increasingly present mobile devices, although not quite practical yet, except for extremely well-funded groups. It is also an operational model that also aims to be an explicit documentation source for building a distributed architecture involving a server and any number of mobile agents, as well as highlighting both the advantages and the drawbacks of executing such an algorithm on smartphones.

Author Biography

Alexandru Marculescu, The Bucharest University of Economic Studies

IT&C Security Master Program

Department of Economic Informatics and Cybernetics


Adam L. Beberg, Daniel L. Ensign, Guha Jayachandran, Siraj Khaliq, Vijay S. Pande - "Folding@home: Lessons from Eight Years of Volunteer Distributed Computing", 8th IEEE International Workshop on High Performance Computational Biology, Proceedings of the 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2009

Benchmark results for Radeon HD 5870

Conference on Shared Knowledge and the Web, Residencia de Estudiantes, Madrid, Spain, Nov. 17-19 2003.

Matt Curtin, Justin Dolske - ”A Brute Force Search of DES Keyspace”, May 1998 issue of “;login:”

Distributed.Net statistics

Distributed.Net statistics / RC5-72 CPU participation

Distributed.Net statistics - client speeds database

Folding@home website,

Galaxy S4: Samsung's 8-core processor explained

Wiki, Landauer’s principle's_principle

Wiki, World energy consumption




How to Cite

Marculescu, A. (2014). Mobile Architecture for Distributed Brute-Force Attacks. Journal of Mobile, Embedded and Distributed Systems, 6(1), 30-37. Retrieved from