Distinguishing attack on five-round Feistel networks

    Research output: Contribution to journalJournal articleResearchpeer-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 languageEnglish
    JournalELECTRON LETT
    Volume39
    Issue number16
    Pages (from-to)1175-1177
    ISSN0013-5194
    Publication statusPublished - 2003

    Cite this