Hash functions for bloom filter

Hi,

In my current implementation project, I need to use bloom filters and
I am trying to figure out which k independent hash functions I should
use for bloom filter. I have a couple of questions:

1) Suppose I decide to use some hash function h, can I simulate k hash
functions required by bloom filter as hi(x) = h(x xor i)?

2) Can anyone suggest a good *non-cryptographic* hash function that
can be used for bloom filters?

Thanks in advance.

.