Doesn't explain using your own hash function, though. SHA-3 doesn't depend on the security of the discrete logarithm or integer factoring problems. Finding SHA-3 collisions on a quantum computer is only quadratically faster than a classical computer.