after learn polynomial hash Heidi decide learn shiftxor hash in particular come interesting problemgiven bitstring y 01n find number different k 0 leq k n exist x 01n y x oplus mboxshiftkxIn oplus xor operation mboxshiftk operation shift bitstring cyclically right k time for example 001 oplus 111 110 mboxshift300010010111000 00000010010111