Results 1 
6 of
6
Cryptographic Hash Functions: A Survey
, 1995
"... This paper gives a survey on cryptographic hash functions. It gives an overview of all types of hash functions and reviews design principals and possible methods of attacks. It also focuses on keyed hash functions and provides the applications, requirements, and constructions of keyed hash functions ..."
Abstract

Cited by 46 (7 self)
 Add to MetaCart
(Show Context)
This paper gives a survey on cryptographic hash functions. It gives an overview of all types of hash functions and reviews design principals and possible methods of attacks. It also focuses on keyed hash functions and provides the applications, requirements, and constructions of keyed hash functions.
Keyed Hash Functions
 in Cryptography: Policy and Algorithms Conference
, 1996
"... . 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 tw ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
. 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. 1 Introduction Hash functions were introduced in early 1950's [20]. The original aim was to have functions that can uniformly map a large collection of messages into a small set of message digests (or hash values). A useful application of hash functions is for error detection. Appending message digest to the message allows detection of errors during transmission. In the receiving end, the hash value of the received message is recalculated and compared with the received hash value. If they do not match, an error has occurred. This detection is only for random errors. An active spoofer may intercept a message, modify it as he wishes, an...
Message Encryption and Authentication Using OneWay Hash Functions
 Proc. of 3rd Annual Workshop on Selected Areas in Cryptology (SAC '96), Queens
, 1996
"... A oneway hash function is an important cryptographic primitive for digital signatures and authentication. Recently much work has been done toward construction of other cryptographic algorithms (e.g., MACs) using hash functions. In particular, such algorithms would be easy to implement with existing ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A oneway hash function is an important cryptographic primitive for digital signatures and authentication. Recently much work has been done toward construction of other cryptographic algorithms (e.g., MACs) using hash functions. In particular, such algorithms would be easy to implement with existing codes of hash functions if they are used as a black box without modification. In this paper we present new such constructions for block ciphers and MACs in some general form (i.e., with variable key sizes, block lengths and MAC lengths). 1 Introduction Hash functions play an important role in various cryptographic protocol designs. They are used as a cryptographic primitive for digital signatures and message/user authentication. Consequently a lot of optimized implementations of hash functions, such as MD5 [23] and SHA [24], exist. In this paper we describe several algorithms constructed from keyed hash functions: DESlike block ciphers, stream cipherlike algorithms and MAC algorithms. Al...
Authenticated Session Keys and Their ServerAided Computation
"... Key exchange is one of the elementary prerequisites for secure communications. This paper first discusses some desirable properties of key exchange protocols, and then presents a set of protocols for DiffieHellman based authenticated key exchange. This paper then considers a serveraided approach t ..."
Abstract
 Add to MetaCart
(Show Context)
Key exchange is one of the elementary prerequisites for secure communications. This paper first discusses some desirable properties of key exchange protocols, and then presents a set of protocols for DiffieHellman based authenticated key exchange. This paper then considers a serveraided approach to fast computation of shared secrets, which may be useful for smart card implementation of key exchange. 1 Introduction One of the elementary prerequisites for secure communications is to establish a secret session key between the communicating parties. The session key can then be used to provide message confidentiality and/or message integrity using symmetric techniques. Entity authentication, a means of obtaining assurance of the communicating partner's identity, is another essential cryptographic mechanism for secure communications in today's distributed computing environment. Authentication and key exchange are often considered jointly. In particular, key exchange must accompany proper ...
Crypto Topics and Applications I
"... INTRODUCTION In this chapter we discuss four related areas of cryptology, namely: Authentication, Hashing, Message Authentication Codes (MACs), and Digital Signatures. These topics represent currently active and growing research topics in cryptology. Due to space limitations, we concentrate only on ..."
Abstract
 Add to MetaCart
(Show Context)
INTRODUCTION In this chapter we discuss four related areas of cryptology, namely: Authentication, Hashing, Message Authentication Codes (MACs), and Digital Signatures. These topics represent currently active and growing research topics in cryptology. Due to space limitations, we concentrate only on the essential aspects of each topic. The bibliography is intended to supplement our survey. We have included sufficiently many items to provide the interested reader with an overall view of the current state of knowledge in the above areas. Authentication deals with the problem of providing assurance to a receiver that a communicated message originates from a particular transmitter, and that the received message has the same content as the transmitted message. A typical authentication scenario occurs in computer networks, where the identity of two communicating entities is established by means of authentication. Hashing is concerned with the problem