INNER CODE UNIT · Python
lhs
demining/CryptoDeepTools · 04AlgorithmsForSecp256k/main.py:47
lhs = (y * y) % E.mod
rhs = (x * x * x + E.A * x + E.B) % E.mod
print(lhs == rhs)
#D = genDivisor(E, 25)
#print(len(D))
#print(D)
INNER CODE UNIT · Python
demining/CryptoDeepTools · 04AlgorithmsForSecp256k/main.py:47
lhs = (y * y) % E.mod
rhs = (x * x * x + E.A * x + E.B) % E.mod
print(lhs == rhs)
#D = genDivisor(E, 25)
#print(len(D))
#print(D)