Class of Easily Implemented Hash Functions
A universal class of hash functions which utilize multiplication over a finite field is described. These functions are easy to implement in hardware and have good 'randomizing' properties.
L. J. Carter et al., "Class of Easily Implemented Hash Functions," IBM Technical Disclosure Bulletin, vol. 26, no. 2, pp. 515-516, Unknown, Jul 1983.
Keywords and Phrases
Data Processing; Computer Metatheory
International Standard Serial Number (ISSN)
Article - Journal
This document is currently not available here.