In the cryptographic primitives. I don't clearly learn that the difference between one-way function and cryptographic on complexity theory. In fact, I only know the one-way function resist the probabilitic polynomial-time adversary attack, but I want to know the complexity of cryptogrphic hash function is what and it whether is an kind of one-way function.
I want to get a detailed and precise answers about it.