Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6469303> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- Q6469303 subject Q8316362.
- Q6469303 subject Q8363826.
- Q6469303 subject Q8445673.
- Q6469303 abstract "In cryptography, Ladder-DES is a block cipher designed in 1994 by Terry Ritter. It is a 4-round Feistel cipher with a block size of 128 bits, using DES as the round function. It has no actual key schedule, so the total key size is 4×56=224 bits.In 1997, Eli Biham found two forms of cryptanalysis for Ladder-DES that depend on the birthday paradox; the key is deduced from the presence or absence of collisions, plaintexts that give equal intermediate values in the encryption process. He presented both a chosen-plaintext attack and a known-plaintext attack; each uses about 236 plaintexts and 290 work, but the known-plaintext attack requires much more memory.".
- Q6469303 wikiPageExternalLink bda8ad116a7769e2.
- Q6469303 wikiPageExternalLink CS0890.pdf.
- Q6469303 wikiPageWikiLink Q1044361.
- Q6469303 wikiPageWikiLink Q1053357.
- Q6469303 wikiPageWikiLink Q135035.
- Q6469303 wikiPageWikiLink Q1557574.
- Q6469303 wikiPageWikiLink Q176916.
- Q6469303 wikiPageWikiLink Q2142762.
- Q6469303 wikiPageWikiLink Q2569509.
- Q6469303 wikiPageWikiLink Q284899.
- Q6469303 wikiPageWikiLink Q2981730.
- Q6469303 wikiPageWikiLink Q339000.
- Q6469303 wikiPageWikiLink Q41621.
- Q6469303 wikiPageWikiLink Q42332.
- Q6469303 wikiPageWikiLink Q471771.
- Q6469303 wikiPageWikiLink Q543151.
- Q6469303 wikiPageWikiLink Q5436988.
- Q6469303 wikiPageWikiLink Q700583.
- Q6469303 wikiPageWikiLink Q8316362.
- Q6469303 wikiPageWikiLink Q8363826.
- Q6469303 wikiPageWikiLink Q8445673.
- Q6469303 wikiPageWikiLink Q8789.
- Q6469303 wikiPageWikiLink Q897511.
- Q6469303 comment "In cryptography, Ladder-DES is a block cipher designed in 1994 by Terry Ritter. It is a 4-round Feistel cipher with a block size of 128 bits, using DES as the round function. It has no actual key schedule, so the total key size is 4×56=224 bits.In 1997, Eli Biham found two forms of cryptanalysis for Ladder-DES that depend on the birthday paradox; the key is deduced from the presence or absence of collisions, plaintexts that give equal intermediate values in the encryption process.".
- Q6469303 label "Ladder-DES".