Python code for Nonce k, k+1

Hey everyone. I was motivated by the table on Iceland's rsz and put together some Python code for scenarios involving k, k+1, ... k+m. I don’t have a private key example to test it against, so I’m reaching out for your help. If it works, I’ll share it on GitHub. It seems like there's no existing resource for this, so it could benefit us all. If anyone could take a look and share feedback, I'd really appreciate it!

Is there no one who can check this?

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 **. 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))

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