2023年9月12日
9.12 RSA
摘要： 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 阅读全文
posted @ 2023-09-12 22:19 N0zoM1z0 阅读(1) 评论(0) 推荐(0) 编辑
RSA小指数攻击
摘要： 当e很小 n很大的时候 直接枚举开方即可 from Crypto.Util.number import * import gmpy2 from gmpy2 import * import primefac def modinv(a,n): return primefac.modinv(a,n) % 阅读全文
posted @ 2023-09-12 08:11 N0zoM1z0 阅读(65) 评论(0) 推荐(0) 编辑