[lange-01] - 0 users already solved this challenge.
This challenge concerns the Discrete Logarithm Problem (DLP) in a "medium" field.
For powers of very small primes and for large prime fields the function-field sieve and the number-field sieve are highly optimized; for intermediate fields algorithms with the same asymptotic behavior exist but the actual running times are slower. Are you able to solve the DLP in such a field anyway?
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Published on: 2011-09-02 12:23
Maximum number of attempts for this challenge: 20
All successful users of this challenge
No one solved the challenge right now. Be the first!