Using volunteer computation to solve cryptographic problems
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 107-108
Cet article a éte moissonné depuis la source Math-Net.Ru
In the paper a technology for solving cryptographic problems in volunteer computing projects is described. Authors have implemented volunteer project SAT@home in which a successful cryptanalysis of the keystream generator A5/1 was performed.
@article{PDMA_2012_5_a56,
author = {O. S. Zaikin and M. A. Posypkin and A. A. Semenov},
title = {Using volunteer computation to solve cryptographic problems},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {107--108},
year = {2012},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a56/}
}
TY - JOUR AU - O. S. Zaikin AU - M. A. Posypkin AU - A. A. Semenov TI - Using volunteer computation to solve cryptographic problems JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2012 SP - 107 EP - 108 IS - 5 UR - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a56/ LA - ru ID - PDMA_2012_5_a56 ER -
O. S. Zaikin; M. A. Posypkin; A. A. Semenov. Using volunteer computation to solve cryptographic problems. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 107-108. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a56/
[1] Platforma BOINC dlya organizatsii dobrovolnykh vychislenii, http://boinc.berkeley.edu/
[2] Proekt dobrovolnykh vychislenii SAT@home, http://sat.isa.ru/pdsat/
[3] Balaton Z., Gombas G., Kacsuk P., et al., “Sztaki desktop grid: a modular and scalable way of building large computing grids”, 21th Intern. Parallel and Distributed Processing Symposium, Long Beach, California, USA, 2007, 1–8 | DOI
[4] Semenov A., Zaikin O., Bespalov D., Posypkin M., “Parallel logical cryptanalysis of the generator A5/1 in BNB-Grid system”, LNCS, 6873, 2011, 473–483
[5] A5/1 Cracking project, http://opensource.srlabs.de/projects/a51-decrypt