摘要: ezRSA part 1 #part1 p = getPrime(512) q = getPrime(512) n = p * q phi = (p-1) * (q-1) d = getPrime(250) e = inverse(d, phi) c = pow(bytes_to_long(part 阅读全文
posted @ 2024-09-25 21:33 YipChip 阅读(141) 评论(0) 推荐(0)