Home Blog Possible New Result in Quantum Factorization I’m skeptical about—and not qualified to review—this new result in factorization with a quantum computer, but if it’s true it’s a theoretical improvement in the speed of factoring large numbers with a quantum computer. Tags: academic papers , cryptanalysis , quantum computing , RSA Posted on March 16, 2026 at 5:46 AM • 1 Comments Comments Luca Mariot • March 16, 2026 5:55 AM Definitely not an improvement; see Aaronson’s blog post: https://scottaaronson.blog/?p=9615 Subscribe to comments on this entry Leave a comment Cancel reply Blog moderation policy Login Name Email URL: Remember personal info? Fill in the blank: the name of this blog is Schneier on ___________ (required): Comments: Allowed HTML <a href="URL"> • <em> <cite> <i> • <strong> <b> • <sub> <sup> • <ul> <ol> <li> • <blockquote> <pre> Markdown Extra syntax via https://michelf.ca/projects/php-markdown/extra/ Δ ← Upcoming Speaking Engagements Sidebar photo of Bruce Schneier by Joe MacInnis. Powered by WordPress Hosted by Pressable