Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

FEAL: Standards & Overview

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…

Language: English [EN]
Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.
100%
More settings
100% 100% 100% 100% 100%

FEAL topic overview

The analysis highlights Standards and Overview as prominent areas in the source structure around FEAL.

Related topics
16
Source areas
1
Connected nodes
17
Extracted relationships
46
Concept neighborhoods
15
Bridge connections
17

What this topic covers Research coverage

Source areas are shown by the number of related topics found in each part of the analysis. Use smaller areas too: they can reveal specialized angles and content gaps.

Overview · 16 topics

Smaller areas are not necessarily less important. They contain fewer connections in this analysis and can be useful for finding specialized angles or coverage gaps.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Block sizes
64 bits
Designers
Akihiro Shimizu and Shoji Miyaguchi (NTT)
First published
FEAL-4 in 1987; FEAL-N/NX in 1990
Key sizes
64 bits (FEAL), 128 bits (FEAL-NX)
Rounds
Originally 4, then 8, then variable (recommended 32)
Structure
Feistel network

Explore all related topics Closing gaps

Browse the complete topic structure, not only the most central items. Less prominent entities and concepts can reveal missing angles, specialized context and useful research gaps. Each item opens a new analysis centered on that subject.

Overview

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

How FEAL connects Entity context

The extracted context around FEAL shows recurring relationship patterns in the source. For example, FEAL → Adi Shamir, Advances, Anne Tardy-Corfdir, Atsuhiro Yamagishi, Attack, Boer, Call, Chosen Plaintexts, Cryptanalysis, CRYPTO, Cryptology, Differential Cryptanalysis, Eli Biham, EUROCRYPT, Fast, FEAL Cipher, FEAL-4, FEAL-6, FEAL-8 Cryptosystem, Gilbert Another extracted example is FEAL → Archived, FEALUS, Peter Gutmann, The FEAL, Wayback Machine. Use these groups to spot repeated connection types before inspecting the individual relationships.

FEAL

Top relations

related to References · 35
FEAL → Adi Shamir, Advances, Anne Tardy-Corfdir, Atsuhiro Yamagishi, Attack, Boer, Call, Chosen Plaintexts, Cryptanalysis, CRYPTO, Cryptology, Differential Cryptanalysis, Eli Biham, EUROCRYPT, Fast, FEAL Cipher, FEAL-4, FEAL-6, FEAL-8 Cryptosystem, Gilbert
related to External links · 5
FEAL → Archived, FEALUS, Peter Gutmann, The FEAL, Wayback Machine
Block sizes · 1
FEAL → 64 bits
Designers · 1
FEAL → Akihiro Shimizu and Shoji Miyaguchi (NTT)
First published · 1
FEAL → FEAL-4 in 1987; FEAL-N/NX in 1990
Key sizes · 1
FEAL → 64 bits (FEAL), 128 bits (FEAL-NX)
Rounds · 1
FEAL → Originally 4, then 8, then variable (recommended 32)
Structure · 1
FEAL → Feistel network

Important terminology

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

cryptanalysis differential attack miyaguchi cipher plaintexts feal-4 1990 known linear rounds feal-8 1991 first den chosen shimizu biham feistel 1988

FEAL relationships Subject–Predicate–Object triples

TTTA extracted 46 structured relationships around FEAL. Examples in this analysis include FEAL → Block sizes → 64 bits and FEAL → Designers → Akihiro Shimizu and Shoji Miyaguchi (NTT). The table shows each extracted connection, where it came from and its confidence.

SubjectPredicateObjectConfidenceSrc
FEALBlock sizes64 bits1.00infobox
FEALDesignersAkihiro Shimizu and Shoji Miyaguchi (NTT)1.00infobox
FEALFirst publishedFEAL-4 in 1987; FEAL-N/NX in 19901.00infobox
FEALKey sizes64 bits (FEAL), 128 bits (FEAL-NX)1.00infobox
FEALRoundsOriginally 4, then 8, then variable (recommended 32)1.00infobox
FEALStructureFeistel network1.00infobox
FEALrelated to External linksThe FEAL0.60section
FEALrelated to External linksPeter Gutmann0.60section
FEALrelated to External linksFEALUS0.60section
FEALrelated to External linksArchived0.60section
FEALrelated to External linksWayback Machine0.60section
FEALrelated to ReferencesEli Biham0.60section

Related concept clusters Concept neighborhoods

The concept neighborhoods around FEAL bring nearby vocabulary together. In this analysis, examples include Known, Miyaguchi and Feistel. Use the clusters to find adjacent concepts and terminology that may deserve separate research.

  • block cipher
    • Feistel
    • Feal
    • 64-bit
    • Faster
    • Miyaguchi
    • Designers
    • Feal-nx
    • Key
    • Matsui
    • Published
    • Yamagishi
    • Differential
  • cryptanalysis
    • Differential
    • Plaintexts
    • Linear
    • Gilbert
    • Feal-4
    • Known
    • Feal-nx
    • Matsui
    • Murphy
    • Published
    • Yamagishi
    • Attack
  • differential cryptanalysis
    • Biham
    • Differential
    • Plaintexts
    • Shamir
    • Linear
    • Attack
    • Gilbert
    • Feal-4
    • Feal-n
    • Known
    • Feal-nx
    • Matsui
  • linear cryptanalysis
    • Plaintexts
    • Differential
    • Linear
    • Matsui
    • Yamagishi
    • Gilbert
    • Feal-4
    • Known
    • Feal-nx
    • Murphy
    • Published
    • Attack
  • shoji miyaguchi
    • Shoji
    • Designers
    • Shimizu
    • Rounds
    • Feal
    • Feal-nx
    • Key
    • Published
    • Feal-8
    • Yamagishi
    • Crypto
    • Attack
  • chosen plaintexts
    • Linear
    • Known
    • Murphy
    • Plaintexts
    • Matsui
    • Published
    • Yamagishi
    • Cryptanalysis
    • Designers
    • Feal-n
    • Feal-nx
    • Key
  • FEAL
    • Known
    • Miyaguchi
    • Feistel
    • Matsui
    • Yamagishi
    • Crypto
    • Shoji
    • Linear
    • Plaintexts
    • Attack
    • 64-bit
    • Designers
  • feal
    • Known
    • Miyaguchi
    • Feistel
    • Matsui
    • Yamagishi
    • Crypto
    • Shoji
    • Linear
    • Plaintexts
    • Attack
    • 64-bit
    • Designers

Connections between topic areas Semantic bridges

Bridges highlight paths between different parts of the FEAL map and can reveal research angles that are easy to miss in a flat list.

Min side: 3

Map overview Semantic statistics

FEAL

Nodes18
Edges17
Triples46
Avg. degree1.89
Density0.111111
Components1

Source & methodology

TTTA analyzes the structure around FEAL to surface related topics, entities, relationships, concept neighborhoods and bridge connections. Use the map to explore areas such as Standards & Overview, including less central topics that may reveal useful research gaps. Automatically extracted connections are research leads rather than rewritten encyclopedia content.

Source: Wikipedia — FEAL · EN edition · Analysis: TopicsToTalkAbout

For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.