Title

Class of Easily Implemented Hash Functions

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.

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

This document is currently not available here.

Share

 
COinS