AuthorsL. Knudsen and H. Raddum
TitleDistinguishing attack on five-round Feistel networks
Afilliation, Communication Systems
Project(s)Simula UiB
StatusPublished
Publication TypeJournal Article
Year of Publication2003
JournalElectronic Letters
Volume39
Issue16
Pagination1175-1177
Date Published08/2003
PublisherIEE
Other NumbersISSN: 0013-5194
Abstract

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

DOI10.1049/el:20030768
Citation Key24076

Contact person