Komi_Hartman on Nostr: Practical application of Shor's algorithm to break RSA-2048 encryption using a real ...
Practical application of Shor's algorithm to break RSA-2048 encryption using a real quantum computer is a significant challenge & likely not feasible..
Relying on a single quantum machine equipped with 20 million qubits, it's feasible to distribute the workload across 8 or 9 separate quantum machines, each equipped with approximately 4 million qubits. The key to making this distributed approach work effectively is connecting these quantum machines via quantum channels with 'substantial bandwidths', each operating at around 150 qubits/second.. (IBM Osprey is a 433-qbit QC).
Consequently, there’s a growing urgency to replace traditional RSA encryption with post-quantum, quantum-resistant algorithms due to the potential vulnerabilities of existing public-key encryption methods when faced with quantum attacks. I ignore the 8 empirical conjectures used in their process or otherwise it can be 'extended & quantum extended Church-Turing thesis', 'NISQ=LDP conjecture', 'bipolar aximatization conjecture'..
https://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf Researcher Claims to Crack RSA-2048 With Quantum Computer.
"Quantum computing has become a reality. We broke the RSA-2048 key," ~Gerck.
https://www.bankinfosecurity.com/blogs/researcher-claims-to-crack-rsa-2048-quantum-computer-p-3536
Published at
2023-11-03 14:56:25Event JSON
{
"id": "2fce75a311d9b753ce6d87af67b009d2617ceda9c6e387fc884087d4cecf35ba",
"pubkey": "81d38469313088cce52b8a860711c21e7408860286bb3834a4d74fab717cde2e",
"created_at": 1699019785,
"kind": 1,
"tags": [
[
"q",
"7b88d4701798740bf3ebeb7ebc8c754d1ee70fff373b1d71bd354de06e1c269c"
],
[
"p",
"81d38469313088cce52b8a860711c21e7408860286bb3834a4d74fab717cde2e"
],
[
"r",
"https://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf"
]
],
"content": "Practical application of Shor's algorithm to break RSA-2048 encryption using a real quantum computer is a significant challenge \u0026 likely not feasible..\n\nRelying on a single quantum machine equipped with 20 million qubits, it's feasible to distribute the workload across 8 or 9 separate quantum machines, each equipped with approximately 4 million qubits. The key to making this distributed approach work effectively is connecting these quantum machines via quantum channels with 'substantial bandwidths', each operating at around 150 qubits/second.. (IBM Osprey is a 433-qbit QC).\n\nConsequently, there’s a growing urgency to replace traditional RSA encryption with post-quantum, quantum-resistant algorithms due to the potential vulnerabilities of existing public-key encryption methods when faced with quantum attacks. I ignore the 8 empirical conjectures used in their process or otherwise it can be 'extended \u0026 quantum extended Church-Turing thesis', 'NISQ=LDP conjecture', 'bipolar aximatization conjecture'..\n\nhttps://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf nostr:note10wydguqhnp6qhultadlterr4f50wwrllxua36udax4x7qmsuy6wqw8c7f4",
"sig": "9e4cefbc832e7566260e341bccb7020bc0505bb0b1c0eb04c08ae3d1a97eead81e47a5fac192adabbfc8c9eb14b05ef194283ebeb9e964938b087b2b8c52a85f"
}
