Definition:Discrete Logarithm Problem/Historical Note
Jump to navigation
Jump to search
Historical Note on Discrete Logarithm Problem
The discrete logarithm problem is known to be a "very difficult" problem to solve for a large cyclic group.
Hence its usefulness in the field of cryptography, where, for example, the Diffie-Hellman-Merkle key exchange technique utilises this very difficulty.
Sources
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): discrete logarithm problem