No abstract

No abstract

This paper deals with a two-key based novel approach for generating a permutation table that can be used in a symmetric cryptographic system to cause diffusion. It also discusses how the permutation table generated using the approach can be applied to character based encryption and binary data block produced at intermediate stages by symmetric cipher algorithms. It also describes the effect of our approach on characters of intermediate text as well as on bits of binary data block along with the impact of a single bit change in key information on producing permutation sequences applied to plaintexts to produce ciphertexts. The results are satisfactory and the proposed approach can be employed in any symmetric block cipher algorithm that uses the predefined permutation tables.

This paper proposes a design of symmetric block cipher algorithm using key-dependent permutations. The main objective is to develop a robust symmetric encryption algorithm resistant to linear and differential attacks. The design resembles Fiestel structure but uses dynamically generated permutation and substitution tables in each round during encryption process to achieve good confusion and diffusion. Plain texts of various sizes are subjected to the algorithm 1984 Arulmani Kuppusamy et al. and the results obtained show that the algorithm produces a good avalanche effect. The avalanche effect is more when there is a single bit change in key applied to the same plain text as compared to a bit change in plain text for the same key.