Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/SIMD_(hash_function)> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- SIMD_(hash_function) abstract "SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition, but was not shortlisted for the third and final round.The designer states that the \"most important component of SIMD is its message expansion, which is designed to give a high minimal distance\". The algorithm's speed is claimed to be 11-13 cycles per byte.".
- SIMD_(hash_function) wikiPageID "23741576".
- SIMD_(hash_function) wikiPageLength "1323".
- SIMD_(hash_function) wikiPageOutDegree "5".
- SIMD_(hash_function) wikiPageRevisionID "427417029".
- SIMD_(hash_function) wikiPageWikiLink Category:NIST_hash_function_competition.
- SIMD_(hash_function) wikiPageWikiLink Cryptographic_hash_function.
- SIMD_(hash_function) wikiPageWikiLink Cycles_per_byte.
- SIMD_(hash_function) wikiPageWikiLink Merkle–Damgård_construction.
- SIMD_(hash_function) wikiPageWikiLink NIST_hash_function_competition.
- SIMD_(hash_function) wikiPageWikiLinkText "SIMD".
- SIMD_(hash_function) wikiPageUsesTemplate Template:Crypto_hash.
- SIMD_(hash_function) wikiPageUsesTemplate Template:For.
- SIMD_(hash_function) wikiPageUsesTemplate Template:Reflist.
- SIMD_(hash_function) subject Category:NIST_hash_function_competition.
- SIMD_(hash_function) hypernym Function.
- SIMD_(hash_function) type Disease.
- SIMD_(hash_function) type Function.
- SIMD_(hash_function) comment "SIMD is a cryptographic hash function based on the Merkle–Damgård construction submitted to the NIST hash function competition by Gaëtan Leurent. It is one of fourteen entries to be accepted into round two of the competition, but was not shortlisted for the third and final round.The designer states that the \"most important component of SIMD is its message expansion, which is designed to give a high minimal distance\". The algorithm's speed is claimed to be 11-13 cycles per byte.".
- SIMD_(hash_function) label "SIMD (hash function)".
- SIMD_(hash_function) sameAs Q7390391.
- SIMD_(hash_function) sameAs m.06zkzx3.
- SIMD_(hash_function) sameAs SIMD_(хеш-функция).
- SIMD_(hash_function) sameAs Q7390391.
- SIMD_(hash_function) wasDerivedFrom SIMD_(hash_function)?oldid=427417029.
- SIMD_(hash_function) isPrimaryTopicOf SIMD_(hash_function).