Complexity analysis of the method of rainbow tables with fingerprints
Matematičeskie voprosy kriptografii, Tome 8 (2017), pp. 99-116

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

The probabilistic model of the operative stage of the rainbow tables with fingerprints method is introduced. It is used to compute the mean time complexity of the complete processing of one table. Two-sided estimates of this complexity are obtained and computational approach to the construction of the optimal fingerprint is suggested. Our probabilistic model as opposed to other models permits to account for the impact of the variance of the preimages number of random uniformly chosen element of a finite set with respect to the one-way function.
@article{MVK_2017_8_a4,
     author = {D. V. Pilshchikov},
     title = {Complexity analysis of the method of rainbow tables with fingerprints},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {99--116},
     publisher = {mathdoc},
     volume = {8},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2017_8_a4/}
}
TY  - JOUR
AU  - D. V. Pilshchikov
TI  - Complexity analysis of the method of rainbow tables with fingerprints
JO  - Matematičeskie voprosy kriptografii
PY  - 2017
SP  - 99
EP  - 116
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MVK_2017_8_a4/
LA  - ru
ID  - MVK_2017_8_a4
ER  - 
%0 Journal Article
%A D. V. Pilshchikov
%T Complexity analysis of the method of rainbow tables with fingerprints
%J Matematičeskie voprosy kriptografii
%D 2017
%P 99-116
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MVK_2017_8_a4/
%G ru
%F MVK_2017_8_a4
D. V. Pilshchikov. Complexity analysis of the method of rainbow tables with fingerprints. Matematičeskie voprosy kriptografii, Tome 8 (2017), pp. 99-116. http://geodesic.mathdoc.fr/item/MVK_2017_8_a4/