|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
I. M. Arbekov, S. N. Molotkov, “Quantum random number generators, extraction of provably random bit sequences from Markov chain trajectories”, UFN, 194:9 (2024), 974–993  ; Phys. Usp., 67:9 (2024), 919–937  |
2
|
|
2023 |
| 2. |
I. M. Arbekov, S. N. Molotkov, “Distribution of secret keys in a quantum network with trusted intermediate nodes”, Mat. Vopr. Kriptogr., 14:3 (2023), 9–33 |
2
|
|
2021 |
| 3. |
I. M. Arbekov, S. N. Molotkov, “Extraction of quantum randomness”, UFN, 191:6 (2021), 651–669  ; Phys. Usp., 64:6 (2021), 617–634  |
11
|
|
2017 |
| 4. |
I. M. Arbekov, “Lower bounds for the practical secrecy of a key”, Mat. Vopr. Kriptogr., 8:2 (2017), 29–38  |
4
|
|
2016 |
| 5. |
I. M. Arbekov, “Criteria of key security”, Mat. Vopr. Kriptogr., 7:1 (2016), 39–56 |
7
|
|
2001 |
| 6. |
I. M. Arbekov, “Key Secrecy in a Quantum Cryptography System Based on Error-Correcting Codes”, Probl. Peredachi Inf., 37:1 (2001), 89–94  ; Problems Inform. Transmission, 37:1 (2001), 80–85 |
|
1998 |
| 7. |
I. M. Arbekov, “Optimum Discretization of Weak-Signal Observations under Constraints on the Quantization Rate”, Probl. Peredachi Inf., 34:1 (1998), 69–76 ; Problems Inform. Transmission, 34:1 (1998), 60–66 |
3
|
|
1996 |
| 8. |
I. M. Arbekov, G. V. Proskurin, “On a lower bound for the probability of the correct classification of observations”, Teor. Veroyatnost. i Primenen., 41:3 (1996), 628–633 ; Theory Probab. Appl., 41:3 (1997), 532–537 |
1
|
|
1994 |
| 9. |
I. M. Arbekov, V. I. Vinokurov, B. V. Ryazanov, “On the problem of detecting random trajectories”, Teor. Veroyatnost. i Primenen., 39:4 (1994), 669–680 ; Theory Probab. Appl., 39:4 (1994), 547–557 |
|
| Organisations |
|
| |
|
|
Contact us: