Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2354940> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Q2354940 subject Q6109049.
- Q2354940 abstract "In cryptography, N-Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al.; weaknesses were published the following year.N-Hash has a 128-bit hash size. A message is divided into 128-bit blocks, and each block is combined with the hash value computed so far using the g compression function. g contains eight rounds, each of which uses an F function, similar to the one used by FEAL.Eli Biham and Adi Shamir (1991) applied the technique of differential cryptanalysis to N-Hash, and showed that collisions could be generated faster than by a birthday attack for N-Hash variants with even up to 12 rounds.".
- Q2354940 wikiPageWikiLink Q1195184.
- Q2354940 wikiPageWikiLink Q1224471.
- Q2354940 wikiPageWikiLink Q1388053.
- Q2354940 wikiPageWikiLink Q2142762.
- Q2354940 wikiPageWikiLink Q3075219.
- Q2354940 wikiPageWikiLink Q320624.
- Q2354940 wikiPageWikiLink Q477202.
- Q2354940 wikiPageWikiLink Q6109049.
- Q2354940 wikiPageWikiLink Q615485.
- Q2354940 wikiPageWikiLink Q8789.
- Q2354940 comment "In cryptography, N-Hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al.; weaknesses were published the following year.N-Hash has a 128-bit hash size. A message is divided into 128-bit blocks, and each block is combined with the hash value computed so far using the g compression function.".
- Q2354940 label "N-Hash".