Keyed hash functions

S. Bakhtiari, R. Safavi-Naini, J. Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

22 Citations (Scopus)

Abstract

We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.

Original languageEnglish
Title of host publicationCryptography: Policy and Algorithms - International Conference, Proceedings
Place of PublicationBerlin ; New York
PublisherSpringer, Springer Nature
Pages201-214
Number of pages14
Volume1029
ISBN (Print)9783540607595
DOIs
Publication statusPublished - 1996
Externally publishedYes
EventInternational Conference on Cryptographic Policy and Algorithms, 1995 - Brisbane, Australia
Duration: 3 Jul 19955 Jul 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1029
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Cryptographic Policy and Algorithms, 1995
CountryAustralia
CityBrisbane
Period3/07/955/07/95

Fingerprint Dive into the research topics of 'Keyed hash functions'. Together they form a unique fingerprint.

Cite this