Impossible differential cryptanalysis for block cipher structures

Jongsung Kim, Seokhie Hong, Jaechul Sung, Sangjin Lee, Jongin Lim, Soohak Sung

Research output: Chapter in Book/Report/Conference proceedingChapter

106 Citations (Scopus)

Abstract

Impossible Differential Cryptanalysis(IDC) [4] uses impossible differential characteristics to retrieve a subkey material for the first or the last several rounds of block ciphers. Thus, the security of a block cipher against IDC can be evaluated by impossible differential characteristics. In this paper, we study impossible differential characteristics of block cipher structures whose round functions are bijective. We introduce a widely applicable method to find various impossible differential characteristics of block cipher structures. Using this method, we find various impossible differential characteristics of known block cipher structures: Nyberg's generalized Feistel network, a generalized CAST256-like structure [14], a generalized MARS-like structure [14], a generalized RC6-like structure [14], and Rijndael structure.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsThomas Johansson, Subhamoy Maitra
PublisherSpringer Verlag
Pages82-96
Number of pages15
ISBN (Print)3540206094, 9783540206095
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2904
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Block cipher structures
  • Impossible Differential Cryptanalysis(IDC)
  • Impossible differential characteristic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Impossible differential cryptanalysis for block cipher structures'. Together they form a unique fingerprint.

Cite this