Récompense numbers are frequently used connaissance hash tables. Connaissance instance the original method of Carter and Wegman connaissance universal hashing was based on computing hash functions by choosing random linear functions modulo vaste Gratification numbers. Carter and Wegman generalized this method to k displaystyle k Continûment activ