A little further: factoring and discrete log aren't a complete set (also, that depends on algorithm development). There are a few academic problems that are als

A little further: factoring and discrete log aren't a complete set (also, that depends on algorithm development). There are a few academic problems that are also exponentially faster, and, more generally to factoring and discrete log: hidden subgroup problems (which are what killed non-supersingular isogeny Diffie-Hellman as a post-quantum key exchange).