Showing papers on "Collision attack published in 1999"
TL;DR: The state of the art for cryptographic hash functions is described, different definitions are compared, and the few theoretical results on hash functions are discussed.
Abstract: This paper describes the state of the art for cryptographic hash functions. Different definitions are compared, and the few theoretical results on hash functions are discussed. A brief overview is presented of the most important constructions, and some open problems are presented.
104 citations
01 Mar 1999
TL;DR: A hash function with all-or-nothing property that can use the existing hash functions without changing their structures, and it is secure against all of known attacks.
Abstract: All-or-nothing property is a new encryption mode proposed by Rivest and has the property that one must decrypt the entire ciphertext to determine any plaintext block. In this paper, we propose a hash function with all-or-nothing property. The proposed scheme can use the existing hash functions without changing their structures, and it is secure against all of known attacks. Moreover, the proposed method can be easily extended to the MAC(Message Authentication Code) and provide message confidentiality as well as authentication.
11 citations
24 Mar 1999
TL;DR: In this article, the authors extend the analysis by considering some more realistic attack models and present an improved attack on multiple modes that contain an OFB mode and discuss practical solutions that take into account realistic constraints.
Abstract: The DES has reached the end of its lifetime due to its too short key length and block length (56 and 64 bits respectively). As we are awaiting the new AES, triple (and double) encryption are the common solution. However, several authors have shown that these multiple modes are much less secure than anticipated. The general belief is that these schemes should not be used, as they are not resistant against attacks requiring 264 chosen plaintexts. This paper extends the analysis by considering some more realistic attack models. It also presents an improved attack on multiple modes that contain an OFB mode and discusses practical solutions that take into account realistic constraints.
11 citations
Journal Article•
TL;DR: A simple but novel family of universal hash functions that is more efficient than many standard constructions is described and compared to the MMH family studied by Halevi and Krawczyk.
Abstract: This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authentication. First, we describe a simple but novel family of universal hash functions that is more efficient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk [12]. All the main techniques used to optimize MMH work on our hash functions as well. Second, we introduce additional techniques for speeding up our constructions; these techniques apply to MMH and may apply to other hash functions. The techniques involve ignoring certain parts of the computation, while still retaining the necessary statistical properties for secure message authentication. Finally, we give implementation results on an ARM processor, Our constructions are general and can be used in any setting where universal hash functions are needed; therefore they may be of independent interest.
6 citations