Sergey V. Grebnev
Research Subjects
Sergey V. Grebnev has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Albert R. Efivmov
National University of Science and Technology MISIS Moscow, Russia
1 shared publication- Aleksey Konstantinovich Fedorov
Russian Quantum Center
1 shared publication Anton P. Guglya
Russian Quantum Center, Skolkovo, Moscow, Russia
1 shared publication- Evgeniy Olegovich Kiktenko
Russian Quantum Center
1 shared publication - Maksim A. Gavreev
Laboratory of Quantum Information Technologies, National University of Science and Technology “MISiS”, Moscow 119049, Russia
1 shared publication - Oleg Turchenko
QApp, Moscow, Russia
1 shared publication
Latest Publications
- 25 May 2024
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 20 (3) , 455-483
Hypericum: a post-quantum digital signature for standardization in Russia
- 25 May 2024
- Published by Springer Nature in Journal of Computer Virology and Hacking Techniques
- Vol. 20 (3) , 455-483
Hypericum: a post-quantum digital signature for standardization in Russia
- Open Access
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 134760-134768
Pitfalls of the Sublinear QAOA-Based Factorization Algorithm
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor’s quantum factorization algorithm requires significant resources scaling linearly with the number size; taking into account an overhead that is required for quantum error correction the estimation is that 20 millions of (noisy) physical qubits are required for factoring 2048-bit RSA key in 8 hours. Recent proposal by Yan et. al. claims a possibility of solving the factorization problem with sublinear quantum resources. As we demonstrate in our work, this proposal lacks systematic analysis of the computational complexity of the classical part of the algorithm, which exploits the Schnorr’s lattice-based approach. We provide several examples illustrating the need in additional resource analysis for the proposed quantum factorization algorithm.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 134760-134768
Open AccessPitfalls of the Sublinear QAOA-Based Factorization Algorithm
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor’s quantum factorization algorithm requires significant resources scaling linearly with the number size; taking into account an overhead that is required for quantum error correction the estimation is that 20 millions of (noisy) physical qubits are required for factoring 2048-bit RSA key in 8 hours. Recent proposal by Yan et. al. claims a possibility of solving the factorization problem with sublinear quantum resources. As we demonstrate in our work, this proposal lacks systematic analysis of the computational complexity of the classical part of the algorithm, which exploits the Schnorr’s lattice-based approach. We provide several examples illustrating the need in additional resource analysis for the proposed quantum factorization algorithm.
- Open Access
- 18 June 2019
- Published by National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) in Bezopasnost informacionnyh tehnology
- Vol. 26 (2) , 6-20
On the cryptographic properties of “Limonnik-3” AKE scheme
О КРИПТОГРАФИЧЕСКИХ СВОЙСТВАХ СХЕМЫ ВЫРАБОТКИ ОБЩЕГО КЛЮЧА “ЛИМОННИК-3”
- 18 June 2019
- Published by National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) in Bezopasnost informacionnyh tehnology
- Vol. 26 (2) , 6-20
Open AccessOn the cryptographic properties of “Limonnik-3” AKE scheme
О КРИПТОГРАФИЧЕСКИХ СВОЙСТВАХ СХЕМЫ ВЫРАБОТКИ ОБЩЕГО КЛЮЧА “ЛИМОННИК-3”