The whole promise is that reversible computation is theoretically free (in quantum information theory) , quantum computer can exploit it by using quantum superposition to brute force 256bit key (and larger) in a single computation cycle.

There’s a massive fundamental flaw in the reasoning behind this.

It’s the second law of thermodynamics - entropy always increases. While computation is free, reversal of entropy isn’t. What we’re being promised is a 21st century version of perpetual motion machine.

Additional explanation:

Think about private key as low entropy, and public key as high entropy. Owner of the private key has cheat code in the form of missing information which allows reversing the entropy of public key.

However in order to break the cryptography you have to reverse public key back into private key without having access to it. The regualr way is to search for flaws in the cryptography scheme that allow reasoning about missing information and consecutively - private key recovery.

But if you do a brute force attack you are 100% forced to pay full thermodynamical price of reversing the entropy. And 2^256 is way, way more than you could ever afford. Even Planck scale values multiplied by that number grow into universe size and beyond.

In summary, quantum computing can skip time component of brute forcing a key, but it can’t skip the energy costs. So it will never happen.

  • theneverfox@pawb.social
    link
    fedilink
    English
    arrow-up
    1
    ·
    20 hours ago

    I think there’s a misunderstanding of the math going on here. A key is lower entropy than random noise, but it’s not what crypto works on - it’s about computation

    You’re not pulling order out of the ether, you’re calculating a solution to a math problem. Normally, it’s an n-p complete problem, meaning it’s just difficult to calculate conventionally. It’ll take n amount of computation cycles, meaning with a large amount of computing power you can break a key in x time, and there’s no known short cuts

    Unless there is a short cut - some key methods have been defeated through math, making them trivial to solve. Others have been defeated through increase in computing power, meaning longer key lengths are necessary

    In the same way, some key methods are theoretically trivial for quantum computing to solve, while others are quantum resistant

    It’s all math at the end of the day