[Cryptography] The race to Quantum machines.
phill at hallambaker.com
Tue May 28 16:53:54 EDT 2019
On Tue, May 28, 2019 at 12:17 PM Tom Mitchell <mitch at niftyegg.com> wrote:
> On Sun, May 26, 2019 at 3:08 AM Peter Gutmann <pgut001 at cs.auckland.ac.nz>
>> Tom Mitchell <mitch at niftyegg.com> writes:
>> >IBM believes that commercial quantum machines will be here in about 3-5
>> >years. If encrypted data at rest today has value or is a liability in
>> >next 3-5 years quantum resistant keys seem important.
>> Uhh, you need to read the rest of the article, which you've actually
>> "Starting its R&D on quantum computing as early as in 1996, IBM
>> released a
>> 5-qubit quantum computer in 2016 and unveiled the world's first 20-qubit
>> system, dubbed IBM Q System One, at CES 2019, Morimoto said, disclosing
>> the company will soon launch 58-qubit quantum computers."
>> From that we have at least a few data points, and there's more from
>> sources, so we can extrapolate over time. Technically we can't actually
>> that because from everything I've read it's nonlinear, the first steps are
>> relatively easy and then it gets harder and harder , but let's say it's
>> linear just for argument's sake. Anyway, to break 1kbit RSA you need
>> about a
>> million qubits. Soon we'll have a computer with 58 qubits. Graphing
>> and drawing a line to where even 1kbit RSA is at risk is left as an
>> for the reader.
> Found this paper:
> How to factor 2048 bit RSA integers in 8 hours using 20 million noisy
> Craig Gidney1 , ∗ and Martin Eker
> Near the end in Conclusions.
> << In, Mosca poses the hypophoric question: “How many physical qubits will
> we need to break RSA-2048? [...]
> << Current estimates range from tens of millions to a billion physical
> qubits”. The upper bound of “a billion physical qubits” is likely from .
> Our physical assumptions are more pessimistic than the physical assumptions
> used in that paper (see Table II), so our results can be directly compared.
> Doing so shows that, in the four years since 2015, the worst case estimate
> of how many qubits will be needed to factor 2048 bit RSA integers has
> dropped nearly two orders of magnitude; from a billion to twenty million.”>>
Oh the number of Qbits needed has indeed reduced. But the optimizations
that they are employing are not necessarily valid for the problem of
factorizing RSA moduli. Consider for example, this special case:
Pretending to factor large numbers on a quantum computer
Basically, Smolin and Co show that the optimizations being employed to
reduce the number of QBits required to implement Shor's algorithm kinda
depend on already knowing the factors of the number.
So yes they are implementing Shor's algorithm but no, they are not
developing systems that can break a deployed RSA scheme.
Oh and it gets worse (or better from my point of view). The claims being
made for increasing the number of QBits don't necessarily represent an
increase in processing capability.
It is all really murky. The bottom line is that we need to take the
potential for quantum cryptanalysis seriously because it could be
devastating for electronic commerce. But we certainly do not need to panic.
The engineering obstacles that need to be overcome to make Quantum
Cryptanalysis viable are of the same order as those required to make fusion
The other point to bear in mind is that we won't know whether there is a
limit to quantum entanglement until we encounter it. There is no law of
physics that states we must be able to form arbitrarily complex
superpositions of quantum states. That is an assumption in our current
models of physics.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cryptography