This research presents,and claries the application of two permutation algorithms,based on chaotic map systems,and applied to a le of speech *** are the Arnold cat map-based permutation algorithm,and the Baker’s chaot...
详细信息
This research presents,and claries the application of two permutation algorithms,based on chaotic map systems,and applied to a le of speech *** are the Arnold cat map-based permutation algorithm,and the Baker’s chaotic map-based permutation *** algorithms are implemented on the same speech signal ***,both the premier and the encrypted le histograms are documented and *** speech signal amplitude values with time signals of the original le are recorded and plotted against the encrypted and decrypted ***,the original le is plotted against the encrypted le,using the spectrogram frequencies of speech signals with the signal *** permutation algorithms are used to shufe the positions of the speech les signals’values without any changes,to produce an encrypted speech le.A comparative analysis is introduced by using some of sundry statistical and experimental analyses for the procedures of encryption and decryption,e.g.,the time of both procedures,the encrypted audio signals histogram,the correlation coefcient between specimens in the premier and encrypted signals,a test of the Spectral Distortion(SD),and the Log-Likelihood Ratio(LLR)*** outcomes of the different experimental and comparative studies demonstrate that the two permutation algorithms(Baker and Arnold)are sufcient for providing an efcient and reliable voice signal encryption ***,the Arnold’s algorithm gives better results in most cases as compared to the results of Baker’s algorithm.
We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorit...
详细信息
We present two simple, intuitive and general algorithmic frameworks that can be used to design a wide variety of permutation generation algorithms. The frameworks can be used to produce 19 existing permutation algorithms, including the well-known algorithms of Heap, Wells, Langdon, Zaks, Tompkins and Lipski. We use the frameworks to design two new sorting-based permutation generation algorithms, one of which is optimal.
Dynamic substitution boxes (S-boxes) are a vital building block of many cryptosystems. The general process of the dynamic construction of a bijective S-box consists of two main components: a random number generator, a...
详细信息
ISBN:
(纸本)9781728167190
Dynamic substitution boxes (S-boxes) are a vital building block of many cryptosystems. The general process of the dynamic construction of a bijective S-box consists of two main components: a random number generator, and a construction algorithm. In this paper, we study the effect of the choice of the construction algorithm on various aspects of the dynamic S-box, including its randomness and it cryptographic strength. We identify the different algorithms found in the literature and present a comparative analysis of their computational complexity and effective key space. Moreover, we study the cryptographic characteristics of the resulting S-boxes. We conclude with some guidelines to help cipher designers choose the S-box construction method most suited for their design objectives.
The features of the development of a reliable system of key reshuffle generation has been considered. This system is based on a classical cipher Girolamo Cardano "square lattice," which corresponds to the mo...
详细信息
ISBN:
(纸本)9786176078067
The features of the development of a reliable system of key reshuffle generation has been considered. This system is based on a classical cipher Girolamo Cardano "square lattice," which corresponds to the modern mathematical formulation. In general, the system allows you to generate a sequence of random numbers in a given range without repeat. With the use of the main provisions of matrix algebra, a mathematical formulation of the algorithm "square lattice" for the generation of permutation keys has been developed. Also shown the mathematical formulation of the algorithm permutation of the rows of an incoming message, where the number of columns can be arbitrary.
暂无评论