With regards to RSA/DH it's because no one knows if factoring is a hard problem or not (see:
RSA problem), it just seems to be from all practical experience. Same for the
discrete logarithm problem, I think those two were also shown to be equivalent. Nice page about it
here