Geodesic
On probability characteristics of random graphs generated by algorithms for finding hash function collisions
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 33-35

Voir la notice de l'article provenant de la source Math-Net.Ru

In the paper, a graph model of some algorithms for finding SHA-1 and RIPEMD collisions is described, and under the described model, an exact formula for calculating average complexity of these algorithms is given.
Keywords: cryptographic hash functions, random graphs.
Mots-clés : collisions 
@article{PDMA_2013_6_a16,
     author = {G. A. Karpunin},
     title = {On probability characteristics of random graphs generated by algorithms for finding hash function collisions},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {33--35},
     publisher = {mathdoc},
     number = {6},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a16/}
}
TY  - JOUR
AU  - G. A. Karpunin
TI  - On probability characteristics of random graphs generated by algorithms for finding hash function collisions
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2013
SP  - 33
EP  - 35
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2013_6_a16/
LA  - ru
ID  - PDMA_2013_6_a16
ER  - 
%0 Journal Article
%A G. A. Karpunin
%T On probability characteristics of random graphs generated by algorithms for finding hash function collisions
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2013
%P 33-35
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2013_6_a16/
%G ru
%F PDMA_2013_6_a16
G. A. Karpunin. On probability characteristics of random graphs generated by algorithms for finding hash function collisions. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 33-35. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a16/