Title: Nonce k, k+1 python code Post by: Bglhn on March 19, 2024, 11:27:49 PM Hello friends. Inspired by the table on iceland's rsz, I created code in phyton for the cases where k,k+1...k+m. Since there is no such example whose private key I know, I ask you to check it. If it works, I will publish it on github. As far as I can see, there is no such resource, we can all benefit from it. Can anyone who sees it please check it out and give their opinions?
Code: def h(n): Title: Re: Nonce k, k+1 python code Post by: Bglhn on March 22, 2024, 08:30:35 AM Is there no one who can check this?
Title: Re: Nonce k, k+1 python code Post by: herecomesjohnny on March 23, 2024, 03:31:09 PM Hello friends. Inspired by the table on iceland's rsz, I created code in phyton for the cases where k,k+1...k+m. Since there is no such example whose private key I know, I ask you to check it. If it works, I will publish it on github. As far as I can see, there is no such resource, we can all benefit from it. Can anyone who sees it please check it out and give their opinions? Syntax Error: There is a syntax error in the last line of your code. The ^ operator is used for bitwise XOR in Python, but it seems you intended to use it for exponentiation. For exponentiation, you should use **.Code: def h(n): Incorrect usage of ^: Even after fixing the syntax error, using ^ for exponentiation won't work as intended. In Python, the correct operator for exponentiation is **. Missing division function: The division in the last line of your code should be a modular division, but it's currently missing. You'll need to implement a modular division function to ensure correctness. code: print(h(((S2 * m * R1 + Z1 * R2 - Z2 * R1) * modinv(S1 * R2 - S2 * R1, N)) % N)) Title: Re: Nonce k, k+1 python code Post by: Bglhn on March 23, 2024, 04:36:17 PM Thank you very much, I will try again.
With your permission, I would like to ask a question; I saw that you also wrote about lattice attack. How can I find known bits? Do you have any knowledge about this topic |