当已知b、c和pow(a, b, c)的结果res时，要找到a的值，可以将问题转化为RSA问题。通过计算z=b-1 mod λ(c)，然后用x = yz mod c求解，其中λ是Carmichael的lambda函数或Euler的phi函数。如果c易于因式分解，可以直接计算；否则，这可能是个难题。提供的代码展示了这些步骤，包括计算逆元和Carmichael函数。"
110223451,9465013,SpringBoot整合Mybatis与PageHelper：配置Druid与实战,"['SpringBoot', 'Mybatis', '数据库连接池', '分页助手', 'Druid']
pow(a,b,c) operator in python returns (a**b)%c . If I have values of b, c, and the result of this operation (res=pow(a,b,c)), how can I find the value of a?
解决方案
Despite the statements in the comments this is not the discrete logarithm problem. This more closely resembles the RSA problem in which c is the product of two large primes, b is the encrypt exponent, and a is the unknown plaintext. I always like to make x the unknown variable you want to solve for, so you have y= xb mod c where y, b, and c are known, you want to solve for x. Solving it involves the same basic number theory as in RSA, namely you must compute z=b-1 mod λ(c), and then you can solve for x via x = yz mod c. λ is Carmichael's lambda function, but you can also use Euler's phi (totient) function instead. We have reduced the original problem to computing an inv
最低0.47元/天 解锁文章
扫一扫
1787
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
