这篇博客介绍了如何利用 Meet-in-the-Middle 攻击来解决在模素数 p 下的离散对数问题。通过将未知数 x 分解为 x = x0 * B + x1，其中 B = 2^20，然后构建哈希表存储左侧等式的值，对于右侧等式的每个可能值进行检查，从而找到解。建议使用 gmpy2 模块以提高效率。
问题：
Your goal this week is to write a program to compute discrete log modulo a prime p . Let g be some element in Z∗p and suppose you are given h in Z∗p such that h=gx where 1≤x≤240 . Your goal is to find x . More precisely, the input to your program is p,g,h and the output is x .
The trivial algorithm for this problem is to try all 240 possible values of x until the correct one is found, that is until we find an x satisfying h=gx in Zp
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
