This is an algorithm based on Chinese remainder problem which can compute the discrete logarithm in a multiplicative group of order q in polynomial time if q is a smooth integer.
This is an algorithm based on Chinese remainder problem which can compute the discrete logarithm in a multiplicative group of order q in polynomial time if q is a smooth integer.
This article is a stub. You can help Wikipedia by expanding it. |