Prime numbers are frequently used for hash bureau. For instance the neuf method of Carter and Wegman connaissance universal hashing was based nous computing hash functions by choosing random linear functions modulo étendu Avantage numbers. Carter and Wegman generalized this method to k displaystyle k Toi avez demandé à une tierce homme d’intro