Geodesic
Using volunteer computation to solve cryptographic problems
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 107-108

Voir la notice de l'article provenant de 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},
     publisher = {mathdoc},
     number = {5},
     year = {2012},
     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
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a56/
LA  - ru
ID  - PDMA_2012_5_a56
ER  - 
%0 Journal Article
%A O. S. Zaikin
%A M. A. Posypkin
%A A. A. Semenov
%T Using volunteer computation to solve cryptographic problems
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 107-108
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a56/
%G ru
%F PDMA_2012_5_a56
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/