What is the discrete log problem?
Answer / Abhinav Kumar
The Discrete Log Problem (DLP) is a fundamental problem in number theory and computational complexity, which asks for finding the logarithm of a given element to a known base modulo a composite integer. Solving DLP is considered computationally hard for many groups, including subgroups of the multiplicative group of a finite field and the group of points on an elliptic curve.
| Is This Answer Correct ? | 0 Yes | 0 No |
How is cryptography applied ?
What is blowfish?
What is OAEP ?
Who are the escrow agencies?
What if users of RSA run out of distinct primes?
How do elliptic curve cryptosystems compare with other cryptosystems ?
What is a CSU, or, How do certifying authorities store their private keys?
What is a hard problem ?
Who needs a key?
What are the most important attacks on MACs ?
What is a linear feedback shift register?
How much extra message length is caused by using RSA?