<<  >> (p.105)
    Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 324868 times)
    Evillo
    Member
    **
    Offline Offline

    Activity: 185
    Merit: 15


    View Profile
    March 10, 2023, 01:47:34 PM
     #2081



    This is quoted from RESEARCHGATE website:
     
    Quote
    We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further beyond current computing than for integer factorisation. A 160 bit elliptic curve cryptographic key could be broken on a quantum computer using around 1000 qubits while factoring the security-wise equivalent 1024 bit RSA modulus would require about 2000 qubits.

    Someone enlighten me, if the above was true.. why isn't Qiskit or IBM a dozen billion dollars richer? According to the abstract above, they both clearly have the qubits necessary to attack ECDSA with Shor lol . Something is not right. This is either overrated estimation of the strength of quantum bits, or IBM/Qiskit are angels.
    While elliptic curve and RSA encryption are different, 160 bit elliptic curve is not used in bitcoin. I would say in order to find a private key by knowing the public key in secp256k1 (bitcoin) you'd need to crack a 2048 RSA key. I might be wrong. According to my own knowledge, the security of bitcoin is 128 bit, if I'm not wrong we'd need to do 2^128 operations to find the target private key.  I would say a very *strong QC, could crack the 2^80 operations in a few days, considering they have a few million terabyte in RAM.

    *= in 15 years from now.

    I get it now .. Thanks 👍
Page 104
Viewing Page: 105