Discrete Logarithm and Hidden Subgroup Algorithms

Algorithms that solve the hard mathematical problems on which public-key cryptography rests, and so bear on how secure those problems keep a scheme. Pollard's kangaroo algorithm, introduced by John M. Pollard in 1978, solves the discrete logarithm problem and works in any finite cyclic group, and Simon's algorithm solves a hidden period problem exponentially faster on a quantum computer than any classical method, which inspired Shor's algorithm. An algorithm belongs here when its cited article describes solving the discrete logarithm problem or a hidden subgroup problem. It excludes the encryption, signature and hashing schemes themselves, which have their own groups.