Print Page - Searching for K nonce

I had made a little change in my code. im just hoping i could receive some advice on whether my method here is more efficient or sound?

i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.

so my question is,

please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?

and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,

please check my code to see where i can improve. thank you.

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

great , I will try

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

I take error:

line 12
SyntaxError: Non-ASCII character '\xc2' in file nonce9.sage.py on line 12, but no encoding declared; see http://python.org/dev/peps/pep-0263/ for details

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Krashfire,

u1 = (modinv(s, n) * z) % n
u2 = (modinv(s, n) * r) % n
if K == (u1 * G + u2 * R):

u1, u2 are known. What a problem find u1*G +u2*R ?

u2 * R is a number? How you add number to point u1*G ?

br

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

bro, test your code at this test data, I try you scrypt from your orevious topic not found k !

this test data from ecdsa123:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

k = 6

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:

k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:

k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

I put this part:

k = (r * i + z) * modinv(s, n) % n
   R = E.lift_x(Integer(r))
   P = k * G
   print("K:", hex(P.xy()[0])) # Print the x-coordinate of K in hexadecimal
   if hex(P.xy()[0]) == hex(r):
   print("Found real k:", hex(P.xy()[0])) # Print the real k in hexadecimal
   break

and put to your code of your presious thread, working.

('Found real k:', 87069027473077907962879272067307854440257155754636880132689937952837782290998, 6)
('Match found for u1 at i =', 0)
('!!!', 6, 4)

but ecdsa123 tell what nonce is 6, not 87069027473077907962879272067307854440257155754636880132689937952837782290998

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

little example how to add your code to bsgs or kangaroo software:

r= 1157805759774926330395047584278303292417$
s= 1157844137307671538341935006214495221120$
z= 2

i = 0

while True:
   k = (z + i )%n # * modinv(s, n) % n #start range
   print("k",k)
   R = E.lift_x(Integer(r))
   K = k * ( modinv(s, n) * G) #( modinv(s, n) * G) - base point
   u1 = (modinv(s, n) * z) % n
   u2 = (modinv(s, n) * r) % n
#if k <=2**100:print("$$$",k,i)
   if K == (u1 * G + u2 * R): # in () is a pubkey
   print("&",k)
   print("yes!!!")
   print("Found real k:", k,i)
   break

   i = i + r

('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717633, 69468345586495579823702855056698197545037187162025383734124577568490557018931

???

enjoy ))

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

lol. of course that wont work. its not real rsz

Quote from: krashfire on April 15, 2024, 08:40:06 AM

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:

k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

lol. of course that wont work. its not real rsz

why this not work ?

replace base pooint and "i" in cangaroo and you take "i" were finder k,after put "i" to your formula....

???

this is work, jast enother way of using cangaroo and bsgs search

try with your real 6 weeks search rsz, and tall what time was need to find k with cuda bsgs or cuda kangaroo ?

thx

ps this is work, bro ;)

Quote from: COBRAS on April 15, 2024, 12:51:59 PM

Quote from: krashfire on April 15, 2024, 08:40:06 AM

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:

k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

lol. of course that wont work. its not real rsz

Hi sir I want to try your code with these rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

Can you help me with script to find private keys from these rsz.

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

use Google .......so I find 2 private key from his 2 rsz

1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Quote from: COBRAS on April 20, 2024, 10:10:59 PM

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

Quote from: COBRAS on April 20, 2024, 10:10:59 PM

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Traceback (most recent call last):
File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 144, in <module>
k = (z + i )%n # * modinv(s, n) % n #start range
NameError: name 'n' is not defined

This error will occur when I directly change the BSGS before running it again

Quote from: COBRAS on April 20, 2024, 10:10:59 PM

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

raceback (most recent call last):
File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 147, in <module>
R = E.lift_x(Integer(r))
NameError: name 'E' is not defined

Oh, after adding n values to my sky, it turned out like this again

Quote from: bnm2610906 on April 20, 2024, 10:29:59 PM

Quote from: COBRAS on April 20, 2024, 10:10:59 PM

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

i answer you in pm

Quote from: COBRAS on April 20, 2024, 11:27:46 PM

Quote from: bnm2610906 on April 20, 2024, 10:29:59 PM

Quote from: COBRAS on April 20, 2024, 10:10:59 PM

Quote from: bnm2610906 on April 20, 2024, 08:41:00 PM

Quote from: COBRAS on April 18, 2024, 09:22:49 PM

Quote from: dexizer7799 on April 18, 2024, 04:45:01 PM

Quote from: krashfire on April 18, 2024, 04:42:19 PM

Quote from: dexizer7799 on April 18, 2024, 04:29:36 PM

Quote from: jacky19790729 on April 18, 2024, 04:27:45 PM

Quote from: COBRAS on April 18, 2024, 04:14:41 PM

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
;D ;D

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

i answer you in pm

Okay thank you

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Traceback (most recent call last):
File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined

It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?

Quote from: bnm2610906 on April 21, 2024, 09:29:45 AM

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

this is a SAGEMATH code, not python

and needs put r,s,z data to:

r=0x
s=0x
z=0x

Quote from: COBRAS on April 21, 2024, 10:44:04 AM

Quote from: bnm2610906 on April 21, 2024, 09:29:45 AM

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

this is a SAGEMATH code, not python

and needs put r,s,z data to:

r=0x
s=0x
z=0x

Okay, thank you, how do I import it into BSGS?

Quote from: COBRAS on April 21, 2024, 10:44:04 AM

Quote from: bnm2610906 on April 21, 2024, 09:29:45 AM

Quote from: krashfire on April 12, 2024, 08:49:21 AM

Code:



import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

this is a SAGEMATH code, not python

and needs put r,s,z data to:

r=0x
s=0x
z=0x

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)) # Base point

I'd like to ask if I start with this line of code, and if so, which range value does it look like?

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

Quote from: bnm2610906 on April 21, 2024, 03:24:28 PM

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

check your pm

Quote from: COBRAS on April 21, 2024, 11:43:29 PM

Quote from: bnm2610906 on April 21, 2024, 03:24:28 PM

Quote from: COBRAS on April 14, 2024, 02:25:35 AM

Quote from: krashfire on April 14, 2024, 01:47:50 AM

Quote from: COBRAS on April 13, 2024, 05:55:51 PM

Quote from: krashfire on April 13, 2024, 05:21:04 AM

Code:


import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

check your pm

Hi you can share the script of kangaroo and bsgs with this method for all not only one.

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Bsgs work example:

xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....

kangroo for ex example never stop and give good speed, so maybe....

bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.

Br

xpoint work bad for me now, maybe I do something wrsng:

same task, no resilt yet:

./keyhunt -m xpoint -r 0:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe9ffff -I 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode xpoint
Stride : 115780575977492633039504758427830329241728645270042306223540962614150928364886
N = 0x100000000
Range
-- from : 0x1
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe9ffff
Allocating memory for 1 elements: 0.00 MB
Bloom filter for 1 elements.
Loading data to the bloomfilter total: 0.03 MB

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

Quote from: krashfire on April 23, 2024, 08:59:08 AM

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

yes ! I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start ;) ...I was understand this using this way

Br

Quote from: COBRAS on April 23, 2024, 09:02:43 AM

Quote from: krashfire on April 23, 2024, 08:59:08 AM

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

Stride length has always been this 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 Or is it what formula did you use to find your stride length It is impossible for other addresses to be this stride length ???

Quote from: bnm2610906 on April 23, 2024, 10:13:58 AM

Quote from: COBRAS on April 23, 2024, 09:02:43 AM

Quote from: krashfire on April 23, 2024, 08:59:08 AM

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

no, straid is from calculus. of r,s,z ;)

Quote from: COBRAS on April 23, 2024, 10:17:39 AM

Quote from: bnm2610906 on April 23, 2024, 10:13:58 AM

Quote from: COBRAS on April 23, 2024, 09:02:43 AM

Quote from: krashfire on April 23, 2024, 08:59:08 AM

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

no, straid is from calculus. of r,s,z ;)

Open the addresses.txt in the file, where did you get it? take the public key below txid R S Z? and start the range and select Z directly?

Quote from: COBRAS on April 23, 2024, 09:02:43 AM

Quote from: krashfire on April 23, 2024, 08:59:08 AM

Quote from: COBRAS on April 23, 2024, 08:54:49 AM

Quote from: krashfire on April 23, 2024, 07:54:16 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

start of search range is always Z signature?

ok i try with different r,s,z. thanks.

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

Brother, I don't know if you use calculus, please, can you write a script that goes straight into RSZ, and he'll figure out what should be there and run it automatically, please, you're my God

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

Hello sir, I used your code, but it doesn't come out at the moment, it's a 2009 wallet transaction address, the output hash value, the last paragraph is pubkey, the above paragraph is pubkeyhasha, can you use your code to run out of the private key?

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

"vout": 0,
"scriptSig": {
"asm": "[ALL] ,
"hex": "
"sequence": 123456
}
],
"vout": [
{
"value": ,
"n": 0,
"scriptPubKey": {
"asm": "OP_DUP OP_HASH160 7xxxxxxxxxxx OP_EQUALVERIFY OP_CHECKSIG",
"desc": "addr()#at0lenfa",
"hex": "7",
"address": "",
"type": "pubkeyhash"
}
},
{
"value": ,
"n": 1,
"scriptPubKey": {
"asm": "0465d00xxx95dc8 OP_CHECKSIG",
"desc": "5d005eedc8)#4my4cmnu",
"hex": "4295bdf1aef6846xxxdc8ac",
"type": "pubkey"

This is a rough hash of the transaction, I deleted it, if this is the case, can you use your code and enter the R S Z of this transaction to run it in 6 weeks

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

Bro, for keyhunt you need replace a base point too.

this data for brute in kangaroo or BSGS:

.BP is a base point:

('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
yes!!!
('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'i', 'i%n', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'hex i%n', 'ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979bf')
('Match found for u1 at i =', 0)
('!!!', 0, 0)
('Matches found for u values:', [('u1', 0)])
xman@localhost:~$

Replace data of base point is file

keyhunt/secp256k1$

SECP256K1.cpp

this strings of base point data:(in this example I am already put data of my base pooint:

// Generator point and order
  G.x.SetBase16("a0d287fb17a25850106cc52227......
  G.y.SetBase16("4df036d34f3bdab912371941cc.......
  G.z.SetInt32(1);
  order.SetBase16

and use with stride

but, keyhunt bad work for me with stride,and I have no vast.ai account now for try stride with this software what has a good stride:

https://bitcointalk.org/index.php?topic=5315607.0

try this with my data and stride.... looks what will be work or not

Bro, if you have any qeschions - you are welcome.

p.s. i in my scrypt and your scrypt are equal !

Br

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

check pm...

Quote from: COBRAS on April 23, 2024, 03:47:47 PM

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

If I were to use
krashfire's code instead of your bsgs Is it also necessary to replace the base point? If you use the code provided by krashfire So what do I need to replace my base point with? Can you elaborate on that?

Quote from: COBRAS on April 23, 2024, 03:47:47 PM

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

The cardinal point is not X Y of the public key? ???

Quote from: bnm2610906 on April 23, 2024, 05:39:48 PM

Quote from: COBRAS on April 23, 2024, 03:47:47 PM

Quote from: krashfire on April 23, 2024, 02:10:42 PM

Quote from: COBRAS on April 23, 2024, 10:52:46 AM

Quote from: COBRAS on April 23, 2024, 06:36:36 AM

Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
Mode BSGS sequential
Opening file addresses.txt
Added 1 points from file
Range
-- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
-- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
N = 0x100000000000
Bloom filter for 4194304 elements : 14.38 MB
Bloom filter for 131072 elements : 0.88 MB
Bloom filter for 4096 elements : 0.88 MB
Allocating 0.00 MB for 4096 bP Points
processing 3145728/4194304 bP points : 7
processing 4194304/4194304 bP points : 100%
Making checkums .. ... done
Sorting 4096 elements... Done!
Thread 0xffd8e700c03997d8c19f5c793fed42f
Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found

this result for this rsz:

r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

The cardinal point is not X Y of the public key? ???

this is a publick for bsgs

('K(pubkey)', (X -110828496909695470428991951019511777919675897427067199301138456851743189635698 : Y -34849073939243886814396770061608715653288911484439836598749957952410646310940 ))

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)

second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,

('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:

range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886 (convert x,y of point and stride to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

Quote from: dexizer7799 on April 24, 2024, 06:23:24 AM

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Quote from: COBRAS on April 24, 2024, 06:32:58 AM

Quote from: dexizer7799 on April 24, 2024, 06:23:24 AM

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?

Quote from: dexizer7799 on April 24, 2024, 06:38:01 AM

Quote from: COBRAS on April 24, 2024, 06:32:58 AM

Quote from: dexizer7799 on April 24, 2024, 06:23:24 AM

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

Quote from: COBRAS on April 24, 2024, 06:39:19 AM

Quote from: dexizer7799 on April 24, 2024, 06:38:01 AM

Quote from: COBRAS on April 24, 2024, 06:32:58 AM

Quote from: dexizer7799 on April 24, 2024, 06:23:24 AM

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

Ok I understand it and what about my rsz how can I get public keys of these rsz, formula script?

Quote from: dexizer7799 on April 24, 2024, 06:42:45 AM

Quote from: COBRAS on April 24, 2024, 06:39:19 AM

Quote from: dexizer7799 on April 24, 2024, 06:38:01 AM

Quote from: COBRAS on April 24, 2024, 06:32:58 AM

Quote from: dexizer7799 on April 24, 2024, 06:23:24 AM

Quote from: COBRAS on April 24, 2024, 06:17:00 AM

Quote from: dexizer7799 on April 24, 2024, 06:07:43 AM

Quote from: COBRAS on April 24, 2024, 05:55:54 AM

Quote from: dexizer7799 on April 24, 2024, 05:34:32 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote

0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672

you replace base point ?

you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

for test data range file is

Quote

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?

publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

Ok I understand it and what about my rsz how can I get public keys of these rsz, formula script?

As I understand R is our public key and Z our k Nonce range?

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

this data for YOUR RSZ !!! MISTER

Quote from: COBRAS on April 24, 2024, 06:49:14 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

this data for YOUR RSZ !!! MISTER

Sir, this is my RSZ. How do I use which software to calculate these

Quote from: COBRAS on April 24, 2024, 06:49:14 AM

Quote from: COBRAS on April 24, 2024, 05:17:11 AM

Quote from: dexizer7799 on April 24, 2024, 05:06:49 AM

Quote from: COBRAS on April 24, 2024, 04:49:01 AM

Quote from: dexizer7799 on April 24, 2024, 04:47:24 AM

Quote from: COBRAS on April 23, 2024, 08:35:28 PM

Quote from: dexizer7799 on April 23, 2024, 07:57:19 PM

Quote from: COBRAS on April 23, 2024, 07:33:24 PM

@299006

use this soft, not bsgs alberto

https://bitcointalk.org/index.php?topic=5315607.0

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?

no way, stride may help

provide your rsz i giive you data of stride, base point and publick

you try this soft

https://bitcointalk.org/index.php?topic=5315607.0

with my test data and stride ?

this data for YOUR RSZ !!! MISTER

（'K（pubkey）'，（110828496909695470428991951019511777919675897427067199301138456851743189635698 ： 34849073939243886814396770061608715653288911484439836598749957952410646310940 ： 1））（
'BP'，（72742032162118480585933344979617114227426107059606997208268050083726572592328 ： 35252511027654091311316081050016893461309059670017896859124791030125997564641 ： 1））
sys：1： DeprecationWarning：
https://trac.sagemath.org/26756
（'BP x'， 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8'）
（'BP y'， '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1'）
（'BP*i'，（110828496909695470428991951019511777919675897427067199301138456851743189635698 ： 34849073939243886814396770061608715653288911484439836598749957952410646310940 ： 1））（
'BP * I X'， '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012'）
（'BP * I Y'， 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12'）
（'stride'， 115780575977492633039504758427830329241728645270042306223540962614150928364886， 'hex r'， 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556'）

Can you share your BP looking script to get the basis point of the RSZ directly, because I use it for other RSZs and it doesn't work for this base point

Bitcoin Forum

Bitcoin => Development & Technical Discussion => Topic started by: krashfire on April 12, 2024, 08:49:21 AM