The S-box is used in various block ciphers and the complexity of encryption essentially depends on the strength of S-box. The strength of an S-box can be measured by analyzing its statistical and algebraic properties. The S-box is the only non-linear component in various block ciphers capable of creating confusion. Many S-boxes have been proposed with similar algebraic and statistical properties. Therefore, it is sometimes difficult to choose an S-box for a particular application. The performances of these S-boxes vary and depend on the nature of data and their application. In this paper, we propose a criterion to analyze the prevailing S-boxes and study their strengths and weaknesses in order to determine their suitability in image encryption applications. The proposed criterion uses the results from correlation analysis, entropy analysis, contrast analysis, homogeneity analysis, energy analysis, and mean of absolute deviation analysis. These analyses are applied to advanced encryption standard (AES), affine-power-affine (APA), gray, Lui J, residue prime, S 8 AES, SKIPJACK, and Xyi Sboxes. The results of these analyses are further examined and a majority logic criterion is used to determine the appropriateness of an S-box to image encryption applications.

Statistical analysis of S-box in image encryption applications based on majority logic criterion

Recently, chaotic dynamics-based data encryption techniques for wired and wireless networks have become a topic of active research in computer science and network security such as robotic systems, encryption, and communication. The main aim of deploying a chaos-based cryptosystem is to provide encryption with several advantages over traditional encryption algorithms such as high security, speed, and reasonable computational overheads and computational power requirements. These challenges have motivated researchers to explore novel chaos-based data encryption techniques with digital logics dealing with hiding information for fast secure communication networks. This work provides an overview of how traditional data encryption techniques are revised and improved to achieve good performance in a secure communication network environment. A comprehensive survey of existing chaos-based data encryption techniques and their application areas are presented. The comparative tables can be used as a guideline to select an encryption technique suitable for the application at hand. Based on the limitations of the existing techniques, an adaptive chaos based data encryption framework of secure communication for future research is proposed

/pdf/applied-cryptography-using-chaos-function-for-fast-digital-3g1v5tec3y.pdf

Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing

The S-box is utilized within different block ciphers and the complexity of encryption basically relies on the quality of S-box. The quality of S-box could be measured by breaking down its statistical properties. The S-box is the main non-linear component in different block ciphers fit for creating confusion. Numerous S-boxes have been proposed with comparative algebraic and statistical properties. Thusly, it is off and on again hard to pick S-box for a specific application. The performances of these S-boxes vary and rely on the way of information and their applications. In this paper; we have proposed a novel chaotic S-box by applying affine transformation to study their strengths in order to determine their suitability in image encryption. The proposed chaotic S-box is tested for different criterion such mean squared error, root mean squared error, mean absolute error, peak signal to noise ratio, signal-to-noise ratio, universal image quality index and enhancement error. The results of these analyses are further examined and are used to determine the appropriateness of S-box to image encryption applications. a–b Lena plain color image, Lena color encrypted image

A Novel Statistical Analysis of Chaotic S-box in Image Encryption

This article is about a criterion based on generalized fuzzy soft expert set to scrutinize the prevailing substitution boxes and learn their properties to sort out their suitability in image encryption applications. The projected criterion makes use of the results of correlation analysis, entropy analysis, contrast analysis, homogeneity analysis, energy analysis, and mean of absolute deviation analysis. These analyses are applied to Advanced Encryption Standard S-box, Affine-Power-Affine S-box, Gray S-box, \(\hbox {S}_{8}\) S-box, residue prime S-box, SKIPJACK S-box and Liu J S-box. The outcome of these analyses is additional observed and a generalized fuzzy soft expert set criterion is used to decide the suitability of an S-box to image encryption applications.

Analysis of S-box image encryption based on generalized fuzzy soft expert set

A recently proposed public key cryptosystem based on Chebyshev polynomials suggests a new approach to data encryption. But the security of the cryptosystem has not been investigated in depth, for lack of an appropriate analysis method. In this paper, a new representation of Chebyshev polynomial is introduced to study security issues of the  cryptosystem. The properties of Chebyshev polynomial sequence are presented, and their impact on the cryptosystem are discussed. Finally some principles for parameter selection for the cryptosystem are proposed. The methodology used in this paper is supposed to offer a useful means for future researches on this topic.

/pdf/parameter-selection-in-public-key-cryptosystem-based-on-5dpkfzkrbn.pdf

Parameter Selection in Public Key Cryptosystem based on Chebyshev Polynomials over Finite Field

Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials by Alfred et al. (1996). We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data by Diffe and Hellman (1976). We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature by Xiao et al. (2007). The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.

	 

	Key words: Chaos, public key, hash, Chebyshev map.

/pdf/public-key-cryptosystems-based-on-chaotic-chebyshev-n2gsnw2k0u.pdf

Public key cryptosystems based on chaotic Chebyshev polynomials

Due to rapid developments in limits and possibilities of communications and information transmissions, there is a growing demand of cryptographic techniques, which has spurred a great deal of intensive research activities in the study of cryptography. This paper describes a public key encryption based on chebyshev polynomials [1].We discuss the algorithm for textual data and present the cryptanalysis which can be performed on this algorithm for the recovery of encrypted data [2]. We also describe a simple hashing algorithm for making this algorithm more secure, and which can also be used for digital signature [3]. The main scope of this paper is to propose an extension of this algorithm to images and videos and making it secure using multilevel scrambling and hash. Software implementations and experimental results are also discussed in detail.

https://www.academicjournals.org/article/article1380030106_Prasadh et al.pdf

R. Gnanajeyaraman

Papers

Public key cryptosystems based on chaotic Chebyshev polynomials

Public key cryptosystems based on chaotic-Chebyshev polynomials