An excellent permutation operator for cryptographic applications

N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Permutations are a core component of almost every cipher. No matter if we consider the DES, AES or most of the other encryption algorithms relevant nowadays, we always find permutation operators as essential building blocks inside. In this contribution we will introduce key-dependent permutation operators of provably excellent quality inspired by chaotic Kolmogorov flows. From chaotic systems theory it is known that the class of Kolmogorov flows exhibits the highest degree of instability among all dynamical systems. As will be derived and proven in detail in this paper, these outstanding properties make them a perfect inspiration for developing a novel class of strong cryptographic permutation operators. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Scharinger, J. (2005). An excellent permutation operator for cryptographic applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3643 LNCS, pp. 317–326). https://doi.org/10.1007/11556985_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free