Using volunteer computation to solve cryptographic problems | Applied Discrete Mathematics. Supplement. 2012. № 5.

Using volunteer computation to solve cryptographic problems

Download file
Counter downloads: 273

Keywords

Authors

NameOrganizationE-mail
Zaikin O.S.Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences (Irkutsk )zaikin.icc@gmail.com
Posypkin M. A.Institute of Systems Analysis, Russian Academy of Sciences (Moscow)posypkin@isa.ru
Semenov A. A.Institute of System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences (Irkutsk )biclop.rambler@yandex.com
Всего: 3

References

Платформа BOINC для организации добровольных вычислений. http://boinc.berkeley. edu/
Проект добровольных вычислений SAT@home. http://sat. isa.ru/pdsat/
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. P. 1-8.
Semenov A., Zaikin O., Bespalov D., and Posypkin M. Parallel logical cryptanalysis of the generator A5/1 in BNB-Grid system // LNCS. 2011. V.6873. P. 473-483.
A5/1 Cracking project. http://reflextor.com/trac/a51/wiki
 Using volunteer computation to solve cryptographic problems | Applied Discrete Mathematics. Supplement. 2012. № 5.

Using volunteer computation to solve cryptographic problems | Applied Discrete Mathematics. Supplement. 2012. № 5.