An Excellent Permutation Operator for Cryptographic Applications
نویسنده
چکیده
Permutations are a core component of almost every cipher. No matter if we consider the DES [5], AES [2] or most of the other encryption algorithms [6] 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 [1, 4]. From chaotic systems theory it is known [3] that the class of Kolmogorov flows exhibits the highest degree of instability among all dynamical systems. As will be demonstrated in the sequel, these outstanding properties make them a perfect inspiration for developing a novel class of strong cryptographic permutation operators.
منابع مشابه
A Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions
Cryptographic hash functions are security primitives that compute check sums of messages in a strong manner and this way are of fundamental importance for ensuring integrity and authenticity in secure communications. However, recent developments in cryptanalysis indicate that conventional approaches to the design of cryptographic hash functions may have some shortcomings. Therefore it is the in...
متن کاملA DNA-Based Cryptographic Key Generation Algorithm
This paper presents a detail description of a new DNA-based cryptographic key generation algorithm that can be used to generate strong cryptographic key(s) for symmetric ciphering applications. The algorithm uses an initial private/secret key as an input to the Key-Based Random Permutation (KBRP) algorithm to generate a permutation of size n, which is half of the size of the required cryptograp...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملA novel symmetric text encryption algorithm based on logistic map
Nowadays, text encryption is recommendable when it is transmitted or stored on insecure channels as Internet. By the other hand, the chaotic systems have excellent characteristics as mixing data, ergodicity, sensitivity to initial conditions, and control parameters, etc., all them useful to design cryptographic algorithms with big size keys and an ef cient permutationdiffusion process. In thi...
متن کاملAnt-Based Crossover for Permutation Problems
Crossover for evolutionary algorithms applied to permutation problems is a difficult and widely discussed topic. In this paper we use ideas from ant colony optimization to design a new permutation crossover operator. One of the advantages of the new crossover operator is the ease to introduce problem specific heuristic knowledge. Empirical tests on a travelling salesperson problem show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005