Class of Easily Implemented Hash Functions

Author

Larry J. Carter
George Markowsky, Missouri University of Science and TechnologyFollow
Mark N. Wegman

Abstract

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.

Recommended Citation

L. J. Carter et al., "Class of Easily Implemented Hash Functions," IBM Technical Disclosure Bulletin, vol. 26, no. 2, pp. 515 - 516, Jul 1983.

Department(s)

Computer Science

Keywords and Phrases

Data Processing; Computer Metatheory

International Standard Serial Number (ISSN)

0018-8689

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Publication Date

01 Jul 1983