“…The following changes to the THA function given by Chou (1985) in remark AS R55 are suggested. University of Liverpool, UK [Received December 1988] In algorithm AS 131 (Leathers, 1978) the hash function consists of a pseudorandom number generator using the key as seed. The description stresses the need to choose a multiplier and constant on the basis of the machine word length but does not point out that integer overflow will occur.…”