Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.physics > #559190 > unrolled thread

Quantum Computer Comes Closer to Cracking RSA Encryption

Started bySam Wormley <swormley1@gmail.com>
First post2016-03-04 09:24 -0600
Last post2016-03-04 10:00 -0600
Articles 2 — 2 participants

Back to article view | Back to sci.physics


Contents

  Quantum Computer Comes Closer to Cracking RSA Encryption Sam Wormley <swormley1@gmail.com> - 2016-03-04 09:24 -0600
    Re: Quantum Computer Comes Closer to Cracking RSA Encryption Sergio <invalid@invalid.com> - 2016-03-04 10:00 -0600

#559190 — Quantum Computer Comes Closer to Cracking RSA Encryption

FromSam Wormley <swormley1@gmail.com>
Date2016-03-04 09:24 -0600
SubjectQuantum Computer Comes Closer to Cracking RSA Encryption
Message-ID<n6GdnRvgV8JWNUTLnZ2dnUU7-fednZ2d@giganews.com>
Quantum Computer Comes Closer to Cracking RSA Encryption
> http://spectrum.ieee.org/tech-talk/computing/hardware/encryptionbusting-quantum-computer-practices-factoring-in-scalable-fiveatom-experiment


> Quantum computers are often heralded as the future of smarter
> searching and lightning fast performance. But their amazing
> mathematical skills may also create grave security risks for data
> that has long been safely guarded by the premise that certain math
> problems are simply too complex for computers to solve.
>
> Now computer scientists at MIT and the University of Innsbruck say
> they've assembled the first five quantum bits (qubits) of a quantum
> computer that could someday factor any number, and thereby crack the
> security of traditional encryption schemes.
>
> Much of the world’s digital data is currently protected by public key
> cryptography, an encryption method that relies on a code based partly
> in factoring large numbers. Computers have traditionally struggled to
> do the calculations based on factoring, so data transferred in this
> way remains secure. On Tuesday, two pioneers of this method,
> Whitfield Diffie and Martin E. Hellman, won the 2015 Turing Award,
> the highest honor in computer science. The thrust of their work
> underpins the most widely used encryption method in the world called
> the RSA algorithm.


-- 

sci.physics is an unmoderated newsgroup dedicated
to the discussion of physics, news from the physics
community, and physics-related social issues.

[toc] | [next] | [standalone]


#559203

FromSergio <invalid@invalid.com>
Date2016-03-04 10:00 -0600
Message-ID<nbcbgl$1nca$1@gioia.aioe.org>
In reply to#559190
On 3/4/2016 9:24 AM, Sam Wormley wrote:
> Quantum Computer Comes Closer to Cracking RSA Encryption

>
>

>>
>> Now computer scientists at MIT and the University of Innsbruck say
>> they've assembled the first five quantum bits (qubits) of a quantum
>> computer that could someday factor any number,

1 quantum bit = 1 Quackbit

1 quackbit hard to read, high error rate!

5 quackbits is a loooooooong way from breaking 1024 bit key rsa


to get more funding,

keep saying quackbits "could someday" (with more funding) break encryption


Note:  NSA took down TRUECRYPT !
it was open source really good encryption for your PC
now GONE.

but there are copies out there, works on win 7 fine, and on some win 10 
machines too.



[toc] | [prev] | [standalone]


Back to top | Article view | sci.physics


csiph-web