Improving Shor’s Algorithm
ID: 13c6c048-99fc-56c4-b8ca-ba4b8265c817
STIX ID: report--13c6c048-99fc-56c4-b8ca-ba4b8265c817
Feed Name: Schneier on Security
A blog post outlines Oded Regev’s enhancement to Shor’s algorithm that reduces the quantum step complexity from O(n^2) to O(n^1.5) for factoring n-bit integers, at the expense of more qubits (from O(n) to O(n^1.5)); while still theoretical, the work could make practical quantum cryptanalysis of RSA and Diffie-Hellman more feasible in the future.
Your team is not currently subscribed to this feed. You must subscribe to it in order to see this post.