摘要:
To review some types of problems solved today. 1. Just using brute force to factorize the n, as long as we find the p and q, we can easily calculate t 阅读全文
摘要:
当e很小 n很大的时候 直接枚举开方即可 from Crypto.Util.number import * import gmpy2 from gmpy2 import * import primefac def modinv(a,n): return primefac.modinv(a,n) % 阅读全文