Toeplitz Hash Algorithm
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The Toeplitz Hash Algorithm describes hash functions that compute hash values through matrix multiplication of the key with a suitable Toeplitz matrix.[1] The Toeplitz Hash Algorithm is used in many network interface controllers for receive side scaling.[2][3]
As an example, with the Toeplitz matrix T the key k results in a hash h as follows:
- h=T⋅k=(110101101011)⋅(1100)=(011)
where the entries are bits and all operations are modulo 2. In implementations the highly redundant matrix is not necessarily explicitly stored.
References
edit edit source- ^ Krawczyk, Hugo (1995). New Hash Functions for Message Authentication. EUROCRYPT '95. Lecture Notes in Computer Science. Vol. 921. pp. 301–310. doi:10.1007/3-540-49264-X_24. ISSN 0302-9743.
- ^ "Scaling in the Linux Networking Stack". Archived from the original on 22 May 2014. Retrieved 2014-05-22.
- ^ "Scalable Networking: Eliminating the Receive Processing Bottleneck—Introducing RSS". Archived from the original on 22 May 2014. Retrieved 2014-05-22.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1289814034 under CC BY-SA 4.0; modifications have been made.