Distinguishing attack on five-round Feistel networks

Lars Ramkilde Knudsen; H Raddum

Distinguishing attack on five-round Feistel networks

Lars Ramkilde Knudsen
, H Raddum

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using O(2/sup 3n/2/) chosen plaintexts or O(2/sup 7n/4/) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2/sup n/ chosen plaintexts or roughly 2/sup 3n/2/ known plaintexts.

Original language	English
Journal	ELECTRON LETT
Volume	39
Issue number	16
Pages (from-to)	1175-1177
ISSN	0013-5194
Publication status	Published - 2003

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{8853fd74343645258498a7f55426d58e,

title = "Distinguishing attack on five-round Feistel networks",

abstract = "Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using O(2/sup 3n/2/) chosen plaintexts or O(2/sup 7n/4/) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2/sup n/ chosen plaintexts or roughly 2/sup 3n/2/ known plaintexts.",

author = "Knudsen, \{Lars Ramkilde\} and H Raddum",

year = "2003",

language = "English",

volume = "39",

pages = "1175--1177",

journal = "ELECTRON LETT",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "16",

}

TY - JOUR

T1 - Distinguishing attack on five-round Feistel networks

AU - Knudsen, Lars Ramkilde

AU - Raddum, H

PY - 2003

Y1 - 2003

N2 - Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using O(2/sup 3n/2/) chosen plaintexts or O(2/sup 7n/4/) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2/sup n/ chosen plaintexts or roughly 2/sup 3n/2/ known plaintexts.

AB - Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using O(2/sup 3n/2/) chosen plaintexts or O(2/sup 7n/4/) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2/sup n/ chosen plaintexts or roughly 2/sup 3n/2/ known plaintexts.

M3 - Journal article

SN - 0013-5194

VL - 39

SP - 1175

EP - 1177

JO - ELECTRON LETT

JF - ELECTRON LETT

IS - 16

ER -