all InfoSec news
Pitfalls of the sublinear QAOA-based factorization algorithm. (arXiv:2303.04656v1 [quant-ph])
cs.CR updates on arXiv.org arxiv.org
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. …
2048-bit rsa account algorithm computing devices error factoring heart key physical prime problem public quantum quantum computing qubits resources rsa scaling shor size tools