Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1187426> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q1187426 subject Q7210623.
- Q1187426 abstract "In cryptography, a preimage attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on its preimage.In the context of attack, there are two types of preimage resistance: preimage resistance: for essentially all pre-specified outputs, it is computationally infeasible to find any input that hashes to that output, i.e., given y, it is difficult to find an x such that h(x) = y. second-preimage resistance: it is computationally infeasible to find any second input which has the same output as that of a specified input, i.e., given x, it is difficult to find a second preimage x′ ≠ x such that h(x) = h(x′).These can be compared with a collision resistance, in which it is computationally infeasible to find any two distinct inputs x, x′ that hash to the same output, i.e., such that h(x) = h(x′).Collision resistance implies second-preimage resistance, but does not guarantee preimage resistance.".
- Q1187426 wikiPageWikiLink Q1139146.
- Q1187426 wikiPageWikiLink Q13414952.
- Q1187426 wikiPageWikiLink Q1779448.
- Q1187426 wikiPageWikiLink Q185235.
- Q1187426 wikiPageWikiLink Q228184.
- Q1187426 wikiPageWikiLink Q2393193.
- Q1187426 wikiPageWikiLink Q389463.
- Q1187426 wikiPageWikiLink Q477202.
- Q1187426 wikiPageWikiLink Q615485.
- Q1187426 wikiPageWikiLink Q628523.
- Q1187426 wikiPageWikiLink Q7210623.
- Q1187426 wikiPageWikiLink Q860623.
- Q1187426 wikiPageWikiLink Q869370.
- Q1187426 wikiPageWikiLink Q8789.
- Q1187426 wikiPageWikiLink Q897511.
- Q1187426 comment "In cryptography, a preimage attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on its preimage.In the context of attack, there are two types of preimage resistance: preimage resistance: for essentially all pre-specified outputs, it is computationally infeasible to find any input that hashes to that output, i.e., given y, it is difficult to find an x such that h(x) = y.".
- Q1187426 label "Preimage attack".