|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
D. V. Pil'shchikov, “On the mean value of the total length of chains computed during the additional checkings in the tradeoff method with distinguished points”, Mat. Vopr. Kriptogr., 13:1 (2022), 101–136   |
|
2019 |
| 2. |
D. V. Pil'shchikov, “On a probabilistic approach to the estimation of reliability of the Hellman method”, Mat. Vopr. Kriptogr., 10:1 (2019), 83–114  |
1
|
|
2017 |
| 3. |
D. V. Pilshchikov, “Complexity analysis of the method of rainbow tables with fingerprints”, Mat. Vopr. Kriptogr., 8:4 (2017), 99–116 |
3
|
| 4. |
D. V. Pilshchikov, “Asymptotic behaviour of the complete preimage cardinality for the image of a random set under iterations of mappings of a finite set”, Mat. Vopr. Kriptogr., 8:1 (2017), 95–106 |
7
|
|
2015 |
| 5. |
D. V. Pilshchikov, “A complexity analysis of algorithm of parallel search of the “gold” collision”, Mat. Vopr. Kriptogr., 6:4 (2015), 77–97 |
2
|
| 6. |
D. V. Pilshchikov, “On the limiting mean values in probabilistic models of time-memory-data tradeoff methods”, Mat. Vopr. Kriptogr., 6:2 (2015), 59–65 |
9
|
|
2014 |
| 7. |
D. V. Pilshchikov, “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”, Mat. Vopr. Kriptogr., 5:2 (2014), 103–108 |
12
|
|
| Organisations |
|
| |
|
|
Contact us: