Universal hashing techniques based on matrix multiplication The article here says below, about a universal hashing technique based on matrix multiplications.

"However, there is a little known method based on using a random matrix. It has lots of advantages - it's a universal family"

I tried to hard to find the source paper of the same to dig deeper but could not. Any references about the technique ?
The source of this result, although it can be found in many other places, is the  Wegman-Carter paper 'Universal classes of hash functions'. More specifically, Proposition 9 in page 151.