TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

How to factor 2048 bit RSA integers in 8 hours using 20M noisy qubits

174 pointsby vtomolealmost 6 years ago

10 comments

Strilancalmost 6 years ago
I'm one of the authors on this paper and can answer questions if people have some.
评论 #19998881 未加载
评论 #19999090 未加载
评论 #19998891 未加载
评论 #20000816 未加载
mmastracalmost 6 years ago
How plausible is it that someone could acquire this many qubits? How many doublings away are we?<p>EDIT: [1] suggests D-wave could be 5640 by 2020, doubling approx. every two years - 12 doublings = 24 years from now.<p>[1] <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;D-Wave_Systems#D-Wave_2X_and_D-Wave_2000Q" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;D-Wave_Systems#D-Wave_2X_and_D...</a>
评论 #19998711 未加载
评论 #19998191 未加载
评论 #19998273 未加载
评论 #19998729 未加载
评论 #19999656 未加载
评论 #19998712 未加载
评论 #20001283 未加载
bscphilalmost 6 years ago
I haven&#x27;t finished reading the paper, but maybe my biggest immediate takeaway is that significantly increasing the number of bits doesn&#x27;t really help. Using the methods discussed in the paper, 4096 bit integers can be factored in less than 4x the amount of time needed to factor 2048 bit integers. In other words, should this method become practical, cryptographers couldn&#x27;t solve the problem by using integers we would ordinarily consider much harder to factor.
评论 #19999389 未加载
评论 #19998790 未加载
评论 #19998749 未加载
评论 #19998358 未加载
评论 #19998616 未加载
评论 #19998791 未加载
评论 #19999722 未加载
kristianpalmost 6 years ago
<a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1905.09749" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1905.09749</a>
imtringuedalmost 6 years ago
It doesn&#x27;t look like there is even a need for quantum proof algorithms. An Epyc CPU with 32 cores has 20 billion transistors. Even if we can build qubits as tiny as a transistor you won&#x27;t be able to break RSA with ridiculous key lengths above 2000000 bits. In reality qubits will be bigger than transistors, not all quibits can be active at the same time and there won&#x27;t be the same exponential growth in the number of qubits as we have seen in conventional computers.
kweksalmost 6 years ago
Relevant presentation on real world cipher reversing with quantum computing:<p><a href="https:&#x2F;&#x2F;www.phdays.com&#x2F;en&#x2F;program&#x2F;reports&#x2F;reversing-cryptographic-primitives-using-quantum-computing&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.phdays.com&#x2F;en&#x2F;program&#x2F;reports&#x2F;reversing-cryptogr...</a><p>Slides: <a href="https:&#x2F;&#x2F;speakerdeck.com&#x2F;rlifchitz&#x2F;ordinateurs-quantiques-et-futur-de-la-securite" rel="nofollow">https:&#x2F;&#x2F;speakerdeck.com&#x2F;rlifchitz&#x2F;ordinateurs-quantiques-et-...</a>
rurbanalmost 6 years ago
How likely is it that for breaking 2048 bit RSA integers you&#x27;ll just need 2048 unnoisy qbits?<p>That this lowered 20M requirement is just ploy to keep people using 2048 bits, not 4K as required by GNU. It is my understanding that 2048 qbits are already in reach to well-funded state agencies.
Tepixalmost 6 years ago
So, is there some alternative quantum-resistant cipher ready (i.e. with open source implementation, say on github) that we can use today to encrypt out long-term secrets?
评论 #20001419 未加载
评论 #20003249 未加载
评论 #20001135 未加载
评论 #20001460 未加载
andralmost 6 years ago
So RSA has some 10-20 years to go. Is there a quantum computing-proof encryption algorithm, or is it just a matter of increasing key lengths?
评论 #20003552 未加载
评论 #20001741 未加载
评论 #20001890 未加载
评论 #20001781 未加载
NotTheFBIalmost 6 years ago
Is this the long fabled quantum computing application that breaks asymmetric cryptography?
评论 #20002075 未加载