Computer Science, Cryptography.
at 2. Both examples are equally insecure. When dealing with the set of all numbers, some strategies allow for the logarithm to be quickly computed even for large numbers. However, for a large prime number Y and a number P that is primitive to it, there is no easy way to compute the logarithm for