Developments in generalized Feistel networks

Seongtaek Chee; Sangjin Lee; Choonsik Park; Soo Hak Sung

doi:10.1049/el:19990482

Developments in generalized Feistel networks

Seongtaek Chee, Sangjin Lee, Choonsik Park, Soo Hak Sung

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

A generalized Feistel networks (GFN) with n parallel bijectives s-boxes per round has proven to be secure against differential and linear cryptanalysis. For n = 1, the maximum average of the differential probability of the GFN with > 3-round is less than or equal to p². For n = 2, it is not difficult to show that the maximum average of differential probability of the GFN with > 6-round is less than or equal to p³. The results indicate that if GFN has n parallel bijective s-boxes per round, the maximum average of differential probability of the GFN with > 3n-round is less than or equal to pⁿ⁺¹.

Original language	English
Pages (from-to)	707-708
Number of pages	2
Journal	Electronics Letters
Volume	35
Issue number	9
DOIs	https://doi.org/10.1049/el:19990482
Publication status	Published - 1999 Apr 29

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1049/el:19990482

Cite this

@article{ab43b78ef1d34181b2116954f03449af,

title = "Developments in generalized Feistel networks",

abstract = "A generalized Feistel networks (GFN) with n parallel bijectives s-boxes per round has proven to be secure against differential and linear cryptanalysis. For n = 1, the maximum average of the differential probability of the GFN with > 3-round is less than or equal to p2. For n = 2, it is not difficult to show that the maximum average of differential probability of the GFN with > 6-round is less than or equal to p3. The results indicate that if GFN has n parallel bijective s-boxes per round, the maximum average of differential probability of the GFN with > 3n-round is less than or equal to pn+1.",

author = "Seongtaek Chee and Sangjin Lee and Choonsik Park and Sung, {Soo Hak}",

year = "1999",

month = apr,

day = "29",

doi = "10.1049/el:19990482",

language = "English",

volume = "35",

pages = "707--708",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley & Sons Inc.",

number = "9",

}

TY - JOUR

T1 - Developments in generalized Feistel networks

AU - Chee, Seongtaek

AU - Lee, Sangjin

AU - Park, Choonsik

AU - Sung, Soo Hak

PY - 1999/4/29

Y1 - 1999/4/29

N2 - A generalized Feistel networks (GFN) with n parallel bijectives s-boxes per round has proven to be secure against differential and linear cryptanalysis. For n = 1, the maximum average of the differential probability of the GFN with > 3-round is less than or equal to p2. For n = 2, it is not difficult to show that the maximum average of differential probability of the GFN with > 6-round is less than or equal to p3. The results indicate that if GFN has n parallel bijective s-boxes per round, the maximum average of differential probability of the GFN with > 3n-round is less than or equal to pn+1.

AB - A generalized Feistel networks (GFN) with n parallel bijectives s-boxes per round has proven to be secure against differential and linear cryptanalysis. For n = 1, the maximum average of the differential probability of the GFN with > 3-round is less than or equal to p2. For n = 2, it is not difficult to show that the maximum average of differential probability of the GFN with > 6-round is less than or equal to p3. The results indicate that if GFN has n parallel bijective s-boxes per round, the maximum average of differential probability of the GFN with > 3n-round is less than or equal to pn+1.

UR - http://www.scopus.com/inward/record.url?scp=0032641526&partnerID=8YFLogxK

U2 - 10.1049/el:19990482

DO - 10.1049/el:19990482

M3 - Article

AN - SCOPUS:0032641526

SN - 0013-5194

VL - 35

SP - 707

EP - 708

JO - Electronics Letters

JF - Electronics Letters

IS - 9

ER -

Developments in generalized Feistel networks

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this