For the present work, it suffices to know that we wish to evaluate the remainders, modulo a large prime number P, of an unbounded sequence of input chunks. Specifically, we shall:
(1) identify a chunk B, which is a character string of fixed size k, with its ASCII encoding; (2) consider this encoding as the
standard binary representation of a large 8k-bit long integer; and (3) evaluate h(B)= B mod P.