Topic: Is there a way to crack Bitcoin without a quantum computer? (Read 84 times)

It's not "a possibility".

If you are among people with a 5th grade education you can generate pseudorandom numbers by using the formula xtimes3plus7.

The kind of algorithms used in pkc create patterns that are hard to find, but the nsa is not in the habit of helping others encrypt data.

I accidentally came across this post, which immediately seemed like nonsense. But after reading other users, I saw in this a number of possibilities and ideas that need to be thought about, especially with the development of AI.

Never mind

Figured it out

What do you mean?

There is no such thing as secure public key cryptography.

The only way to make Bitcoin, or anything else, secure over public lines is to use one time cyphers. Like everybody could have a thumb drive with gigabytes of random data, and share a few kb each communication to secure it. To do that ultimately each network would have to begin with a physical exchange of keys.

Some companies are trying to perpetuate the pkc scam into the quantum era.

Britain is heavy on that since pkc has given them enormous benefits over other countries til now. They have companies like Arqqit developing all kinds of silliness to continue the trickery.

Shouldn't we consider quantumizing Bitcoin?     

It's generally accepted that quantum computers can crack any Public Key algorithm fairly quickly.

PKC uses some wildcard, like modulus, to create an algorithm that creates a system with a large number of curves which makes it difficult to crack. You have to find the size of the difference between consecutive curves in order to figure out which curve a specific key is on.

With quantum computers it is easy.

You need to test a large number of keys first. Start with any private/public key pair and then generate public keys for the next y number of consecutive public keys,

Plot each generated public key individually on an xy axis with the original public key. A very high number of charts with two points.

Then do the same with each y consecutives following the second key.

Now you have a very large number of charts with three points.

Discard all work where the three points deviate by more than 5 degrees.

Start step one again, now starting with three points.

Once you have the curve then you can apply it to any public key to locate its private key.

The problem with this crack is that in a complicated algorithm the space between the first two keys could be in the millions, so you would be testing more pairs than a regular computer could do in a reasonable amount of time.

Is there a way to shorten the search so it could be done on a cheap pc?  


Edit to add /

Looking for a PRACTICAL suggestion.

Obviously consecutive points will deviate by less than a millionth of a degree, so saying "I can reduce your search time 5 million fold by switching from 5 degrees to a millionth of a degree" is not helpful.

Likewise other similar obvious suggestions.