Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MVK_2015_6_a4, author = {D. V. Pilshchikov}, title = {A complexity analysis of algorithm of parallel search of the ``gold'' collision}, journal = {Matemati\v{c}eskie voprosy kriptografii}, pages = {77--97}, publisher = {mathdoc}, volume = {6}, year = {2015}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MVK_2015_6_a4/} }
D. V. Pilshchikov. A complexity analysis of algorithm of parallel search of the ``gold'' collision. Matematičeskie voprosy kriptografii, Tome 6 (2015), pp. 77-97. http://geodesic.mathdoc.fr/item/MVK_2015_6_a4/
[1] Oorschot P. C., Wiener M. J., “Parallel collision search with cryptanalytic applications”, J. Cryptology, 12 (1999), 1–28 | DOI | MR | Zbl
[2] Oorschot P. C., Wiener M. J., “Parallel collision search with application to hash functions and discrete logarithms”, 2nd ACM Conf. on Computer and Commun. Security, Fairfax, Virginia, 1994, 210–218
[3] Oorschot P. C., Wiener M. J., “Improving implementable meet-in-the-middle attacks by orders of magnitude”, CRYPTO' 96, Lect. Notes Comput. Sci., 1109, 1996, 229–236 | DOI | MR
[4] Borst J., Preneel B., Vandewalle J., “On the time-memory tradeoff between exhaustive key search and table precomputation”, Proc. 19th Symp. Inf. Theory in the Benelux, Veldhoven, Netherlands, 1998, 111–118
[5] Standaert F. X., Rouvroy G., Quisquater J. J., Legat J. D., “A time-memory tradeoff using distinguished points: New analysis FPGA results”, Proc. CHES 2002, Lect. Notes Comput. Sci., 2523, 2003, 596–611
[6] Pilshchikov D. V., “Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton–Watson process”, Matematicheskie voprosy kriptografii, 5:2 (2014), 103–108
[7] Pilshchikov D. V., “On the limiting mean values in probabilistic models of time-memory-data tradeoff methods”, Matematicheskie voprosy kriptografii, 6:2 (2015), 59–65 | MR