On the F-function of FEAL

Authors:
Walter Fumy
Affiliations:
-
Venue:
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Year:
1987

Citing 5
Cited 2

Cryptanalysis of DES with a reduced number of rounds

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On the design of S-boxes

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Cryptanalysis of F.E.A.L

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Structured Design of Substitution-Permutation Encryption Networks

IEEE Transactions on Computers
Fast data encipherment algorithm FEAL

EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques

Cryptanalysis of F.E.A.L

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cryptographic strength of a Feistel Cipher depends strongly on the properties of its F-function, Certain characteristics of the F-function of the Fast Data Encipherment Algorithm (FEAL) are investigated and compared to characteristics of the F-function of the Data Encryption Standard (DES). The effects of several straight-forward modifications of FEAL's F-function are discussed.