Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/FEAL> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples per page.
- FEAL abstract "In cryptography, FEAL (the Fast data Encipherment ALgorithm) is a block cipher proposed as an alternative to the Data Encryption Standard (DES), and designed to be much faster in software. The Feistel based algorithm was first published in 1987 by Akihiro Shimizu and Shoji Miyaguchi from NTT. The cipher is susceptible to various forms of cryptanalysis, and has acted as a catalyst in the discovery of differential and linear cryptanalysis.There have been several different revisions of FEAL, though all are Feistel ciphers, and make use of the same basic round function and operate on a 64-bit block. One of the earliest designs is now termed FEAL-4, which has four rounds and a 64-bit key. Problems were found with FEAL-4 from the start: Bert den Boer related a weakness in an unpublished rump session at the same conference where the cipher was first presented. A later paper (den Boer, 1988) describes an attack requiring 100–10000 chosen plaintexts, and Sean Murphy (1990) found an improvement that needs only 20 chosen plaintexts. Murphy and den Boer's methods contain elements similar to those used in differential cryptanalysis.The designers countered by doubling the number of rounds, FEAL-8 (Shimizu and Miyaguchi, 1988). However, eight rounds also proved to be insufficient — in 1989, at the Securicom conference, Eli Biham and Adi Shamir described a differential attack on the cipher, mentioned in (Miyaguchi, 1989). Gilbert and Chassé (1990) subsequently published a statistical attack similar to differential cryptanalysis which requires 10000 pairs of chosen plaintexts.In response, the designers introduced a variable-round cipher, FEAL-N (Miyaguchi, 1990), where "N" was chosen by the user, together with FEAL-NX, which had a larger 128-bit key. Biham and Shamir's differential cryptanalysis (1991) showed that both FEAL-N and FEAL-NX could be broken faster than exhaustive search for N ≤ 31. Later attacks, precursors to linear cryptanalysis, could break versions under the known plaintext assumption, first (Tardy-Corfdir and Gilbert, 1991) and then (Matsui and Yamagishi, 1992), the latter breaking FEAL-4 with 5 known plaintexts, FEAL-6 with 100, and FEAL-8 with 215.In 1994, Ohta and Aoki presented a linear cryptanalytic attack against FEAL-8 that required 212 known plaintexts.".
- FEAL thumbnail FEAL_InfoBox_Diagram.png?width=300.
- FEAL wikiPageExternalLink groups?selm=54gq4q%242d7%40scream.auckland.ac.nz.
- FEAL wikiPageExternalLink feal.
- FEAL wikiPageExternalLink srchnum.htm&Sect1=PTO1&Sect2=HITOFF&p=1&r=0&l=50&f=S&d=PALL.
- FEAL wikiPageID "592532".
- FEAL wikiPageLength "5131".
- FEAL wikiPageOutDegree "26".
- FEAL wikiPageRevisionID "683287662".
- FEAL wikiPageWikiLink Adi_Shamir.
- FEAL wikiPageWikiLink Akihiro_Shimizu.
- FEAL wikiPageWikiLink Block_cipher.
- FEAL wikiPageWikiLink Block_size_(cryptography).
- FEAL wikiPageWikiLink Category:Broken_block_ciphers.
- FEAL wikiPageWikiLink Category:Feistel_ciphers.
- FEAL wikiPageWikiLink Chosen-plaintext_attack.
- FEAL wikiPageWikiLink Chosen_plaintext.
- FEAL wikiPageWikiLink Cryptanalysis.
- FEAL wikiPageWikiLink Cryptography.
- FEAL wikiPageWikiLink Data_Encryption_Standard.
- FEAL wikiPageWikiLink Differential_attack.
- FEAL wikiPageWikiLink Differential_cryptanalysis.
- FEAL wikiPageWikiLink Eli_Biham.
- FEAL wikiPageWikiLink Feistel_cipher.
- FEAL wikiPageWikiLink Feistel_network.
- FEAL wikiPageWikiLink Key_(cryptography).
- FEAL wikiPageWikiLink Known-plaintext_attack.
- FEAL wikiPageWikiLink Known_plaintext.
- FEAL wikiPageWikiLink Linear_cryptanalysis.
- FEAL wikiPageWikiLink N-Hash.
- FEAL wikiPageWikiLink Nippon_Telegraph_and_Telephone.
- FEAL wikiPageWikiLink Shoji_Miyaguchi.
- FEAL wikiPageWikiLink File:FEAL_InfoBox_Diagram.png.
- FEAL wikiPageWikiLinkText "FEAL".
- FEAL wikiPageWikiLinkText "FEAL-4".
- FEAL blockSize "64".
- FEAL caption "The FEAL Feistel function".
- FEAL cryptanalysis "Linear cryptanalysis can break FEAL-4 with 5 known plaintexts . A differential attack breaks FEAL-N/NX with fewer than 31 rounds .".
- FEAL designers "Akihiro Shimizu and Shoji Miyaguchi".
- FEAL hasPhotoCollection FEAL.
- FEAL keySize "64".
- FEAL name "FEAL".
- FEAL publishDate "FEAL-4 in 1987; FEAL-N/NX in 1990".
- FEAL rounds "Originally 4, then 8, then variable".
- FEAL structure Feistel_cipher.
- FEAL structure Feistel_network.
- FEAL wikiPageUsesTemplate Template:Cryptography_navbox.
- FEAL wikiPageUsesTemplate Template:Infobox_block_cipher.
- FEAL wikiPageUsesTemplate Template:Inline_citations.
- FEAL wikiPageUsesTemplate Template:Reflist.
- FEAL subject Category:Broken_block_ciphers.
- FEAL subject Category:Feistel_ciphers.
- FEAL hypernym Cipher.
- FEAL type Algorithm.
- FEAL comment "In cryptography, FEAL (the Fast data Encipherment ALgorithm) is a block cipher proposed as an alternative to the Data Encryption Standard (DES), and designed to be much faster in software. The Feistel based algorithm was first published in 1987 by Akihiro Shimizu and Shoji Miyaguchi from NTT.".
- FEAL label "FEAL".
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs m.02t98k.
- FEAL sameAs FEAL.
- FEAL sameAs FEAL.
- FEAL sameAs Q1388053.
- FEAL sameAs Q1388053.
- FEAL wasDerivedFrom FEAL?oldid=683287662.
- FEAL depiction FEAL_InfoBox_Diagram.png.
- FEAL isPrimaryTopicOf FEAL.