Research any topic before you write.

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

FEAL

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…

Standards & Overview

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around FEAL. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

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

Topics to explore

Browse the full topic structure. 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.

Map overview Semantic statistics

FEAL

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

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

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 Word statistics

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

Entity relationships Subject–Predicate–Object triples

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

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

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