Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Pearson_hashing> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- Pearson_hashing abstract "Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number of bytes, it produces as output a single byte that is strongly dependent on every byte of the input. Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255.This hash function is a CBC-MAC that uses an 8-bit random block cipher implemented via the permutation table. An 8-bitblock cipher has negligible cryptographic security, so the Pearson hash function is not cryptographically strong; but it offers these benefits: It is extremely simple. It executes quickly on resource-limited processors. There is no simple class of inputs for which collisions (identical outputs) are especially likely. Given a small, privileged set of inputs (e.g., reserved words for a compiler), the permutation table can be adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function.One of its drawbacks when compared with other hashing algorithms designed for 8-bit processors is the suggested 256 byte lookup table, which can be prohibitively large for a small microcontroller with a program memory size on the order of hundreds of bytes. A workaround to this is to use a simple permutation function instead of a table stored in program memory. However, using a too simple function, such as T[i] = 255-i partly defeats the usability as a hash function as anagrams will result in the same hash value; using a too complex function, on the other hand, will affect speed negatively.The algorithm can be described by the following pseudocode, which computes the hash of message C using the permutation table T:h := 0for each c in C loop index := h xor c h := T[index]end loopreturn h".
- Pearson_hashing wikiPageID "101219".
- Pearson_hashing wikiPageRevisionID "586534035".
- Pearson_hashing hasPhotoCollection Pearson_hashing.
- Pearson_hashing subject Category:Articles_with_example_pseudocode.
- Pearson_hashing subject Category:Error_detection_and_correction.
- Pearson_hashing subject Category:Hash_functions.
- Pearson_hashing type Abstraction100002137.
- Pearson_hashing type Function113783816.
- Pearson_hashing type HashFunctions.
- Pearson_hashing type MathematicalRelation113783581.
- Pearson_hashing type Relation100031921.
- Pearson_hashing comment "Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number of bytes, it produces as output a single byte that is strongly dependent on every byte of the input. Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255.This hash function is a CBC-MAC that uses an 8-bit random block cipher implemented via the permutation table.".
- Pearson_hashing label "Pearson hashing".
- Pearson_hashing sameAs m.0pqwt.
- Pearson_hashing sameAs Q7158377.
- Pearson_hashing sameAs Q7158377.
- Pearson_hashing sameAs Pearson_hashing.
- Pearson_hashing wasDerivedFrom Pearson_hashing?oldid=586534035.
- Pearson_hashing isPrimaryTopicOf Pearson_hashing.