Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2011_13_a32, author = {O. S. Zaikin}, title = {Solving of cryptanalysis problems in grid systems (by the example of {BOINC)}}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {66--67}, publisher = {mathdoc}, number = {13}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a32/} }
O. S. Zaikin. Solving of cryptanalysis problems in grid systems (by the example of BOINC). Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 66-67. http://geodesic.mathdoc.fr/item/PDM_2011_13_a32/
[1] Zaikin O. S., Semenov A. A., “Tekhnologiya krupnoblochnogo parallelizma v SAT-zadachakh”, Problemy upravleniya, 2008, no. 1, 43–50
[2] Zaikin O. S., “Realizatsiya protsedur prognozirovaniya trudoemkosti parallelnogo resheniya SAT-zadach”, Vestnik UGATU, 14:4(39) (2010), 210–220
[3] Posypkin M. A., Zaikin O. S., Bespalov D. V., Semenov A. A., “Reshenie zadach kriptoanaliza potochnykh shifrov v raspredelennykh vychislitelnykh sredakh”, Trudy ISA RAN, 46, 2009, 119–137
[4] Berkeley Open Infrastructure for Network Computing http://boinc.berkeley.edu
[5] SZTAKI desktop grig http://www.desktopgrid.hu