ericn0v4

What do you think can it be used for compute private key for public key I mean can it be used for break Ecdsa?

Hola! You can check this one https://amnesia.sh/ctf/2024/03/14/htb-arranged.html

Anyone know how to get the k nonce from a private key with this formula I found? Check it out here: https://bitcoin.stackexchange.com/questions/116825/can-a-signer-recover-their-own-signatures-nonce-k. Are there any…

Ok sir I understand you now I solve up to 210 bits! Thank You.

Hi sir, I tried to construct my script with 3 signatures but each time I got wrong private keys so I tried to use your script it works perfectly but when I change this variable it don't work this nonces =…

This script can find a nonce up to 125 bits, but we need to bump it up to 256 bits or more. When I try to raise it to 130 bits or higher, it fails to find the correct key. We need to modify the script to support 256…

Yes your code is right I know that. But unfortunately we cannot do invalid curve attack in these parameters I think only with mapping between curves.

I think only mapping coordinates from original curve to twist and private key order must be same.

Oh sorry I wrote it by phone you can check this code p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f ** 2 K = GF(p) a = K(0x0000000000000000000000000000000000000000000000000000000000000000) b =…

Yes we can increase p parameter of secp256k1 to do invalid/twist attack but we got infinity point and if you will factorize that prime you will see all factored primes p =…

I know that if you will look in this example https://ask.sagemath.org/question/78809/convert-secp256k1-g-point-to-twist-sextic-curve/ you will see that we can map to another curve Secp256K1 but we cannot do invalid…

Here is pattern script recover private key. https://crypto.stackexchange.com/questions/102514/recovering-nonce-in-ecdsa-with-known-shared-components-in-ecdsa There is also lattice attack for that…

Hi sir it works perfectly but when range is 80 or more I cannot find because range is big to find the divided pubkey and do calculation. What can I do in that situation to solve that problem? Example I want to do…

Thank you very much sir for share it I will try it, thank you.

Sir ok can you do this for this public key? 0245a6b3f8eeab8e88501a9a25391318dce9bf35e24c377ee82799543606bf5212

Example for this public key 0245a6b3f8eeab8e88501a9a25391318dce9bf35e24c377ee82799543606bf5212 how can I calculate with that formula?

Hi sir can you share real example with that library, thank you.

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

Hi sir I want to try your code with these rsz 1: r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc z =…