Real prime factorization by quantum computers exists. However, the prime factors are not that large and it is within the capability of even classical computers to work it out. To really break RSA encryption will require far more complete quantum error correction coding. So far QECC with a Hamming distance greater than 1 is difficult.
I have one possible way to avoid some of these problems, Maybe we should limit our dependency on computer systems and networks of an every greater complexity. The entire logistical systems of modern economies is computerized and web-based, when just 30 years ago is was done by hand for the most part. At a certain point it seems to me this does not make life so much better, at least for the majority of us, but keeps tech execs in a bigger money stream. LC On Monday, November 2, 2020 at 1:39:23 PM UTC-6 [email protected] wrote: > Quantum-computing pioneer warns of complacency over Internet security > <https://www.nature.com/articles/d41586-020-03068-9?utm_source=Nature+Briefing&utm_campaign=5d17f78b40-briefing-dy-20201102&utm_medium=email&utm_term=0_c9dfd39373-5d17f78b40-44221073> > > John K Clark > -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/f2861658-a9eb-498b-b90c-9795d17182dfn%40googlegroups.com.
