Has RSA-2048 bit encryption been broken by Quantum Computing?

[Caute_cautim]

Hi All

A statement has been made by https://www.linkedin.com/in/edgerck/

"Today, we could announce it. Quantum computing (QC) has become a reality. We broke the RSA -2048 key. Ron Rivest is a dear friend, but that was needed to advance.

The QC version used here has simultaneous multiple-states logic (following ‘all states at once’), with more than a googol of possible states."

A googol is 100 zeros:

A googol is 10 to the 100th power, which is 1 followed by 100 zeros. While this is an unimaginably large number, there's still an infinite quantity of larger numbers.

"We show that the equivalence of QC techniques (with IBM, Google and others compared with our version of QC) has been hidden for about 2,500 years – since Pythagoras.

All our QC computations were done in a commercial cellphone, or a commercial Linux desktop, as our QC devices -- opening the user market to many industries. No cryogenics or special materials were used.

A post-quantum, HIPAA compliant, end-to-end, patent-free, export-free, secure online solution, is being created, based on ZSentry as used from 2004 to 2014, to replace RSA. One needs a quantum-resistant algorithm, because all existing public-key encryption can be broken.

The U.S. NIST needs to deprecate RSA today! Otherwise, SNDL continues.

Is it true, apparently he will be making an official announcement or is this just a Halloween joke?

We factored (and published in LinkedIn) numbers with more than 10^1000 decimal digits, and the capital cost was less than $1,000.

The quantum computing (QC) version used here uses simultaneous multiple-states logic (following ‘all states at once’), with more than a googol of possible states.

We show that the equivalence of QC techniques (with IBM, Google and others compared with our version of QC) has been hidden for about 2,500 years – since Pythagoras.

All our computations were done in a commercial cellphone, or a commercial Linux desktop, as our QC devices -- opening the user market to many industries. No cryogenics or special materials were used.

A post-quantum, HIPAA compliant, end-to-end, patent-free, export-free, secure online solution, is being created, based on ZSentry as used from 2004 to 2014, to replace RSA. One needs a quantum-resistant algorithm, because all existing public-key encryption can be broken.

We further present 8 empirical conjectures, all supported by experiments, that should be helpful in the further development of QC, and applications to other areas. Applications to healthcare and cosmology are suggested."

(In publication)

https://www.youtube.com/watch?v=-UrdExQW0cs

Awaiting an official announcement.

If this is true, we have a serious issue worldwide!

Let the debate commence......

Regards

Caute_Cautim

[denbesten]

---

@Caute_cautim wrote:

No need to speculate, it is under international scrutiny by cryptographic experts.

---

And I think we all anticipate the same conclusion.  But that really does not matter that much.  There has long been a risk that RSA will be declared "weak". This may come about by Ed, by QC, or by something else.  

My speculation is more about validating that this risk can be addressed by the incident response plan entitled "Vulnerability detected; apply patches".   And, I believe it would.  

What I have come to realize is that encryption algorithms, like any other piece of software, are "wear items" -- akin to a car's tires.   Using this analogy, I am hoping we have the luxury of upgrading while the car is in the shop due to tread-wear and not on the side-of-the-road due to a blowout.

[Caute_cautim]

HI All

More scrutiny, people want proof.

https://www.bankinfosecurity.com/blogs/researcher-claims-to-crack-rsa-2048-quantum-computer-p-3536

Regards

Caute_Cautim

[Early_Adopter]

Aw C’mon Gerkie! Hurry up with that papetcv

As ever the one making the extraordinary claim needs to present the extraordinary evidence…

[Caute_cautim]

Well there have been developments, originally it was Shor's algorithm which stated it could break Public Key Cryptography, now Oded Regev has developed a faster algorithm, which instead of using one dimension and large numbers, uses smaller numbers, but appears to need a lot of memory to process it.

Things are moving very quickly indeed:

https://arxiv.org/abs/2308.06572

Regards

Caute_Cautim

[Early_Adopter]

Let’s all get ready for TLS 2.0

[Caute_cautim]

@Early_AdopterMost probably a PQC algorithm like SPHINCS+ using Lattice cryptography - which is faster than RSA or ECDH etc

Regards

Caute_Cautim

[Early_Adopter]

I remember hearing Jon Callas talk about Max Ellis once, apparently it’s good, slow and hungry.

Anyway with cryptography we should drive the car the dealer gives us, and let the mechanics worry about the engine - AKA don’t roll your own… first thought.

Second thought …Don’t tolerate outdated crypto modules in your stack.