Results 1 
6 of
6
Hash Functions Based on Block Ciphers
 Proc. of EUROCRYPT 92
, 1993
"... . Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing mbit ..."
Abstract

Cited by 54 (7 self)
 Add to MetaCart
. Iterated hash functions based on block ciphers are treated. Five attacks on an iterated hash function and on its round function are formulated. The wisdom of strengthening such hash functions by constraining the last block of the message to be hashed is stressed. Schemes for constructing mbit and 2mbit hash round functions from mbit block ciphers are studied. A principle is formalized for evaluating the strength of hash round functions, viz., that applying computationally simple #in both directions# invertible transformations to the input and output of a hash round function yields a new hash round function with the same security. By applying this principle, four attacks on three previously proposed 2mbit hash round functions are formulated. Finally, three new hash round functions based on an mbit block cipher with a 2mbit key are proposed. 1 Introduction This paper is intended to provide a rather rounded treatment of hash functions that are obtained by iterati...
New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the ParallelDM
, 1995
"... . In this paper attacks on double block length hash functions using a block cipher are considered. We present attacks on all double block length hash functions of hash rate 1, that is, hash functions where in each round the block cipher is used twice, s.t. one encryption is needed per message block. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. In this paper attacks on double block length hash functions using a block cipher are considered. We present attacks on all double block length hash functions of hash rate 1, that is, hash functions where in each round the block cipher is used twice, s.t. one encryption is needed per message block. In particular, our attacks break the ParallelDM presented at Crypto'93[3]. 1 Introduction A hash function is an easily implementable mapping from the set of all binary sequences to the set of binary sequences of some fixed length. An iterated hash function is a hash function Hash(\Delta) determined by an easily computable function h(\Delta; \Delta) from two binary sequences of respective lengths m and l to a binary sequence of length m in the manner that the message M = (M1 ; M2 ; :::; Mn ), where M i is of length l, is hashed to the hash value H = Hn of length m by computing recursively H i = h(H i\Gamma1 ; M i ) i = 1; 2; :::; n; (1) where H0 is a specified initial value. The function...
Keso  a scalable, reliable and secure read/write peerto peer file system
, 2004
"... In this thesis we present the design of Keso, a distributed and completely decentralized file system based on the peertopeer overlay network DKS. While designing Keso we have taken into account many of the problems that exist in today’s distributed file systems. Traditionally, distributed file sys ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this thesis we present the design of Keso, a distributed and completely decentralized file system based on the peertopeer overlay network DKS. While designing Keso we have taken into account many of the problems that exist in today’s distributed file systems. Traditionally, distributed file systems have been built around dedicated file servers which often use expensive hardware to minimize the risk of breakdown and to handle the load. System administrators are required to monitor the load and disk usage of the file servers and to manually add clients and servers to the system. Another drawback with centralized file systems are that a lot of storage space is unused on clients. Measurements we have taken on existing computer systems has shown that a large part of the storage capacity of workstations is unused. In the system we looked at there was three times as much storage space available on workstations than was stored in the distributed file system. We have also shown that much data stored in a production use distributed file system is redundant. The main goals for the design of Keso has been that it should make use of spare
Attacks on Double Block Length Hash Functions
 in Fast Software Encryption
, 1993
"... Attacks on double block length hash functions using a block cipher are considered in this paper. We present a general freestart attack, in which the attacker is free to choose the initial value, and a real attack on a large class of hash functions. Recent results on the complexities of attacks on d ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Attacks on double block length hash functions using a block cipher are considered in this paper. We present a general freestart attack, in which the attacker is free to choose the initial value, and a real attack on a large class of hash functions. Recent results on the complexities of attacks on double block hash functions are summarized. 1 Introduction A hash function is an easily implementable mapping from the set of all binary sequences of some specified minimum length or greater to the set of binary sequences of some fixed length. In cryptographic applications, hash functions are used within digital signature schemes and within schemes to provide data integrity (e.g., to detect modification of a message). An iterated hash function is a hash function Hash(\Delta) determined by an easily computable function h(\Delta; \Delta) from two binary sequences of respective lengths m and l to a binary sequence of length m in the manner that the message M = (M 1 ; M 2 ; :::; M n ), where M i...
LAB Mode for Iterated Hash Functions
, 2010
"... Abstract.In this paper,we proposed a efficient and laconic mode for iterative hash functions and tried to fix the flaws of the MerkleDamgaard construction completely and certainly tried to prevent varieties of those generic attacks,such as Multicollisions Attack,Second Preimage Attack and Herding A ..."
Abstract
 Add to MetaCart
Abstract.In this paper,we proposed a efficient and laconic mode for iterative hash functions and tried to fix the flaws of the MerkleDamgaard construction completely and certainly tried to prevent varieties of those generic attacks,such as Multicollisions Attack,Second Preimage Attack and Herding Attack.The structure of this new mode is different from HAIFA or any other proposal,it contains a new method “Locking Abutting Blocks”(LAB)with checksum,it makes a large size of connotative chaining value without requirements of intricate computing and large memory and it allows for an online computation in one pass with a fixed memory independently.It’s also easy to avoid the generic attacks (presented by Praveen Gauravaram and John Kelsey) which apply on the hash functions with linearXOR/additive checksum.
On the Use of Cryptographic Dedicated Hash Functions for Digital Signatures
"... Abstract. Cryptographic hash functions are an important building block for a wide range of applications such as digital signatures. In this paper, we give an overview of cryptographic hash functions; classification, definitions, and their basic security. We give special emphasis on cryptographic ded ..."
Abstract
 Add to MetaCart
Abstract. Cryptographic hash functions are an important building block for a wide range of applications such as digital signatures. In this paper, we give an overview of cryptographic hash functions; classification, definitions, and their basic security. We give special emphasis on cryptographic dedicated hash functions with summarizing the recent attacks on MD5 and SHA1. Finally, we discuss the design and security of the hash functions SHAfamily. Key words and phrases: hash functions, digital signature, dedicated hash functions 1.