我在中间算法中研究一个部分;也称为“碰撞算法”。这是密码
Python 3 Program To Calculate The Discrete Logarithm Problem Using The Collision Algorithm
import math;
def discreteLogarithm(a, b, m):
n = int(math.sqrt (m) + 1);
# Calculate a ^ n
an = 1;
for i in range(n):
an = (an * a) % m;
value = [0] * m;
# Store all values of a^(n*i) of LHS
cur = an;
for i in range(1, n + 1):
if (value[ cur ] == 0):
value[ cur ] = i;
cur = (cur * an) % m;
cur = b;
for i in range(n + 1):
# Calculate (a ^ j) * b and check
# for collision
if (value[cur] > 0):
ans = value[cur] * n - i;
if (ans < m):
return ans;
cur = (cur * a) % m;
return -1;
# Driver code
a = 2;
b = 3;
m = 5;
print(discreteLogarithm(a, b, m));
# This code is contributed by mits.
考虑到这段代码,我实际上遇到了一个问题
我的意图是将这段代码分成几个部分,分别应用它们。在下面代码的这一部分中,我试图应用某种打印函数来打印已存储的所有迭代,但我并没有完全正确
# Store all values of a^(n*i) of LHS
cur = an;
for i in range(1, n + 1):
if (value[ cur ] == 0):
value[ cur ] = i;
cur = (cur * an) % m;
您正在寻找
print()
函数吗?下面是一个带有一些打印输出的代码示例。请注意,在代码的某些行末尾有不必要的分号。我把它们拿走了相关问题 更多 >
编程相关推荐