To reduce the number of conflicts in caches, hash function are used. One family of hash function that has been reported to perform well in the presence of stride patterns are based on XOR-ing address bits together. We show that, in contrast to traditional modulo-$2^m$-based hashing, for XOR-based hashing the alignment of a stride pattern has a significant impact. We present some properties that allow to quickly determine an optimal base address.