Discrete Lyapunov Exponent and Differential Cryptanalysis

G. Jakimoski, K. P. Subbalakshmi

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

Partly motivated by the developments in chaos-based block cipher design, a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice was recently proposed. We explore the relation between the discrete Lyapunov exponent and the maximum differential probability of a bijective mapping (i.e., an S-box or the mapping defined by a block cipher). Our analysis shows that “good” encryption transformations have discrete Lyapunov exponents close to the discrete Lyapunov exponent of a mapping that has a perfect nonlinearity. The converse does not hold.

Original languageEnglish
Pages (from-to)499-501
Number of pages3
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Volume54
Issue number6
DOIs
StatePublished - 7 Jun 2007

Keywords

  • Block ciphers
  • Lyapunov exponent
  • chaotic maps
  • differential crypt-analysis
  • discrete chaos
  • maximum differential probability (DP)

Fingerprint

Dive into the research topics of 'Discrete Lyapunov Exponent and Differential Cryptanalysis'. Together they form a unique fingerprint.

Cite this