An excellent permutation operator for cryptographic applications

Authors:
Josef Scharinger
Affiliations:
Institute of Computational Perception, Johannes Kepler University, Linz, Austria
Venue:
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Year:
2005

Citing 3
Cited 1

Numerical recipes in C: the art of scientific computing

Numerical recipes in C: the art of scientific computing
Spread Spectrum Systems

Spread Spectrum Systems
Performance Improvement of Spread Spectrum Based Image Watermarking Schemes through M-ary Modulation

IH '99 Proceedings of the Third International Workshop on Information Hiding

A systems theoretic approach to the design of scalable cryptographic hash functions

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory

Quantified Score

Hi-index	0.00

Visualization

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.