1,752,143 research outputs found
Evolving hash functions by means of genetic programming
Full text linkProceedings of the 8th annual conference on Genetic and evolutionary computation. Seattle, Washington, USA, July 08-12, 2006The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fast hash functions. We use a fitness function based on a non-linearity measure, producing evolved hashes with a good degree of Avalanche Effect. Efficiency is assured by using only very fast operators (both in hardware and software) and by limiting the number of nodes. Using this approach, we have created a new hash function, which we call gp-hash, that is able to outperform a set of five human-generated, widely-used hash functions.This article has been financed by the Spanish founded research MCyT project OP:LINK, Ref:TIN2005-08818-C04-02.Publicad
Bridging distributed hash tables in wireless ad-hoc networks
Full text linkThe adaptation of structured P2P networks, i.e.
Distributed Hash Tables (DHTs), to wireless ad-hoc networks has
been investigated in recent years. Existing work assume all peers
would come to an agreement on establishing one uniform DHT
across the entire network. However, in reality, there isn’t a defacto
standard of DHT implementation, different DHTs co-exist.
We present a novel protocol, known as the DHT-gatewaying
model, which enables cross-DHT searching between multiple
DHTs of different implementations
Hash függvények
Full text linkA szakdolgozat a hash függvények konstruálásáról, fontosabb változatairól, az ellenük történő esetleges támadási lehetőségekről és a főbb alkalmazási területekről szól.Bs
XML Data Integrity Based on Concatenated Hash Function
Full text linkData integrity is the fundamental for data authentication. A major problem for XML data authentication is that signed XML data can be copied to another document but still keep signature valid. This is caused by XML data integrity protecting. Through investigation, the paper discovered that besides data content integrity, XML data integrity should also protect element location information, and context referential integrity under fine-grained security situation. The aim of this paper is to propose a model for XML data integrity considering XML data features. The paper presents an XML data integrity model named as CSR (content integrity, structure integrity, context referential integrity) based on a concatenated hash function. XML data content integrity is ensured using an iterative hash process, structure integrity is protected by hashing an absolute path string from root node, and context referential integrity is ensured by protecting context-related elements. Presented XML data integrity model can satisfy integrity requirements under situation of fine-grained security, and compatible with XML signature. Through evaluation, the integrity model presented has a higher efficiency on digest value-generation than the Merkle hash tree-based integrity model for XML data
Goode Hash arranges broomcorn
No full textGoode Hash sits in a chair with a bundle of broomcorn in his lap. Hash holds a single stalk in his left hand, either removing or adding it to the group of stalks held in his right hand
Goode Hash whittles broomcorn
No full textGoode Hash sits outside with broomcorn stalks in his lap. Hash holds one stalk in his right hand and slices through it with a knife in his left hand. Part of the broom making process
Goode Hash makes broomcorn broom
No full textGoode Hash sits in a chair beneath a light, tying a broomcorn broom together. Finished brooms lay across a chair to the right of Hash
Hash láncok és alkalmazásaik
No full textA szakdolgozat négy fő részből áll. Az első részben a legismertebb hash függvények kerülnek bemutatására, majd a hash függvények néhány általános felhasználási területéről esik szó. A második részben a hash láncok fajtáiról, illetve tulajdonságaikról van szó. A harmadik részben a hash láncok alkalmazási területeinek az ismertetésére kerül sor, a negyedik részben pedig egy C# példa programon keresztül kerül bemutatásra a hash lánc alkalmazása.BSc/BAMérnök Informatiku
Goode Hash ties handle of broomcorn broom
No full textGoode Hash sits in a chair in front of a fireplace, tying stalks of broomcorn together to make a broom. Finished brooms lean up against another chair to the right of Hash
Goode Hash works with broomcorn stalks
No full textGoode Hash sits on a chair outside in front of a woodpile. Stalks of broomcorn lay across his lap. Hash holds a stalk in one hand and a knife in the other as he removes leaves from the broomcorn
- …
