Groups
Category
The discrete logarithm problem asks for x such that g^x ≡ h (mod p) in a multiplicative group modulo a prime p.
Meet-in-the-middle splits a hard exponential search into two halves, enumerates each half, and then combines results efficiently.