Some of our astute readers noticed an apparent anomaly in the graph comparing the complexities of Shor’s algorithm and GNFS in the original blog. Specifically, it seemed as though GNFS (General Number Field Sieve) outperformed quantum-accelerated Shor’s algorithm for practical RSA key sizes (e.g., 2048 bits). This led to the seemingly absurd conclusion that RSA…
First seen on securityboulevard.com
Jump to article: securityboulevard.com/2025/01/clarification-on-shors-algorithm-and-gnfs-comparison/
