impossible RSA: 没啥好说的,跟我之前文章有道题类似,虽然如此还是花费了很长时间,原因令人落泪,把q = inverse(e,p)的数学式写成了eq mod p导致数学式推导及其困难(能推但无用) 解题脚本: #coding:utf-8 from Crypto.Util.number import * import math n = 159875761393418887886488630005344176403006103104006672850959515252081456893…