I totally have no idea about this Rabin decrypt problem. source code:
https://github.com/shanzhuer/myctf/blob/main/crypto/rabin.py
Inside there were $2^{21}$ times of encryption and decryption of Rabin-cryptosystem, with 126 bytes plaintext, 1024-bit public key $N$(unknown 512-bit $p$ and $q$ when $p*q=N$)
the output log is $\dfrac{140}{2^{21}}$ decrypt failure because $2$ small root of ciphertext(less than 126 bytes) exists
and the hint is "Quadratic method to solve if p problem"
I was trying several days to find out how to use the Quadratic method to factor $N$ in this question but didn't work
Can anyone help?
