An illustration of a magnifying glass. An illustration of a magnifying glass.

Suppose that N equals 1 million. Approximately how much faster is an algorithm that performs NlgN operations versus one that performs N^2 operations? Recall that lg is the base-2 logarithm function.

ABSTRACT: This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DLP onto several DLPs of smaller ...