The State of Cryptographic Hash Functions

Preneel, Bart

doi:10.1007/3-540-48969-x_8

Cited by 73 publications

(48 citation statements)

References 70 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This will then allow the person who generated the matrix to easily generate collisions. As stated by Preneel in [15], it is possible to avoid this problem if the matrix generation is reproducible by a user. The matrix could then simply be the output of a pseudo-random generator and this would solve both the problems of trapdoors and that of the huge matrix size.…”

Section: Resultsmentioning

confidence: 99%

A Family of Fast Syndrome Based Cryptographic Hash Functions

Augot

Finiasz

Sendrier

2005

Lecture Notes in Computer Science

110

View full text Add to dashboard Cite

Abstract. Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using similar constructions can however still be considered secure. Nevertheless, this has drawn attention on the need for new hash function designs. In this article is presented a family of secure hash functions, whose security is directly related to the syndrome decoding problem from the theory of error-correcting codes. Taking into account the analysis by Coron and Joux [4] based on Wagner's generalized birthday algorithm [19] we study the asymptotical security of our functions. We demonstrate that this attack is always exponential in terms of the length of the hash value. We also study the work-factor of this attack, along with other attacks from coding theory, for non asymptotic range, i.e. for practical values. Accordingly, we propose a few sets of parameters giving a good security and either a faster hashing or a shorter description for the function.

show abstract

Section: Resultsmentioning

confidence: 99%

A Family of Fast Syndrome Based Cryptographic Hash Functions

Augot

Finiasz

Sendrier

2005

Lecture Notes in Computer Science

110

View full text Add to dashboard Cite

show abstract

“…Peers in DHTs such as Chord, CAN, Pastry and Tapestry maintain an index for O (log n) peers where n is the total number of peers in the system. Inherent to the design of a DHT are the following issues [11]: (i) generation of node-ids and object-ids, called keys, using cryptographic/randomizing hash functions such as SHA-1 [15][17] [30]. The objects and nodes are mapped on the overlay network depending on their key value.…”

Section: Distributed Hash Tablesmentioning

confidence: 99%

Peer-to-Peer Cloud Provisioning: Service Discovery and Load-Balancing

Ranjan

Zhao²,

Wu³

et al. 2010

Computer Communications and Networks

View full text Add to dashboard Cite

Clouds have evolved as the next generation platform that facilitates creation of widearea on-demand renting of computing or storage services for hosting application services that experience highly variable workloads and requires high availability and performance. Inter-connecting Cloud computing system components (servers, VMs, application services) through peer-to-peer routing and information dissemination structure is essential to avoid the problems of provisioning efficiency bottleneck and single point of failure that are predominantly associated with traditional centralized or hierarchical approaches. These limitations can be overcome by connecting Cloud system components using a structured peer-to-peer network model (such as Distributed Hash Tables (DHTs)). DHTs offer deterministic information/query routing and discovery with close to logarithmic bounds with regards to network message complexity. By maintaining a small routing state of O (log n) per VM, a DHT structure guarantees deterministic look ups in a completely decentralized and distributed manner. This chapter presents: (i) a layered peer-to-peer Cloud provisioning architecture; (ii) a summary of the current state-of-the-art in Cloud provisioning with particular emphasis on service discovery and load-balancing; (iii) a classification of the existing peer-to-peer network management model with focus on extending the DHTs for indexing and managing complex provisioning information; and (iv) the design and implementation of novel, extensible software fabric (Cloud peer) that combines public/private clouds, overlay networking and structured peer-to-peer indexing techniques for supporting scalable and self-managing service discovery and load-balancing in Cloud computing environments. Finally, an experimental evaluation is presented that demonstrates the feasibility of building next generation Cloud provisioning systems based on peer-to-peer network management and information dissemination models. The experimental test-bed has been deployed on a public cloud computing platform, Amazon EC2, which demonstrates the effectiveness of the proposed peer-to-peer Cloud provisioning software fabric.

show abstract

“…In order to define these attacks in a formal way, one needs to formally specify a model of computation, the inputs of the algorithm, the type of algorithm, the input distributions, etc. We will skip this as formal definitions are not essential to understand the results in this paper (see, for example, [40]). Collision attacks, second-preimage attacks, and preimage attacks can be applied to both the compression function and the hash function.…”

Section: General Constructions For Hash Functionsmentioning

confidence: 99%