Multilayer crypto method using playing cards shuffling operation

A simplified and efficient technique of cryptography of an image will be developed. The technique will utilize two simple rounds to apply image encryption and decryption, each round will be implemented by performing a simple rows shuffling and columns shuffling, eliminating the need for computational logical and arithmetic operations required for other techniques of image encryption. Our approach, while simplifying computational demands by eliminating complex arithmetic and logical operations, maintains robust security through the integration of dual Chaotic Logistic Map Models (CLMM) to generate highly sensitive indices keys. These indices keys control row and column shuffling, which provides a high degree of permutation and resists known-plaintext and cipher text-only attacks. The technique will require two secret indices keys, these keys will be variable in the length and the contents and they will depend on the image to be encrypted-decrypted, generation of these keys will be very easy and simple. The shuffling operations will be implemented using two secret indices keys, and by implementing couple of chaotic logistic map these keys will be produced using selected chaotic parameters values included in the private key. The technique uses a 256-bit private key, chaotic logistic maps, and high sensitivity to parameter variations to achieve "Very strong" key space entropy, with encryption throughput of 19,540 KB/s and robust performance across diverse image sizes. The generated decrypted image may become so sensitive to chosen of private key values, and any little variation in the private key through the decryption task, it will be showed as a hacking try. The proposed technique will be flexible, it will be used to process every image with any size (gray and/or color), and image changing will not require any updating in the decryption and encryption processes. The developed technique will be efficient; it will decrease both the encryption and decryption times, and it lead to accelerate the image encryption process comparing with other techniques. The study systematically utilizes specific evaluation metrics to substantiate claims regarding the quality, security, and velocity of the proposed cryptographic technique. Quality is assessed by Mean Square Error (MSE) and Peak Signal-to-Noise Ratio (PSNR) metrics

Protecting digital speech files is an important issue. In this paper's research, a simplified method of speech file cryptography will be provided, and the encryption and decryption functions will require a reduced number of operations. The encryption function will perform a put_operation to reorder the speech sample to get the encrypted file, while the decryption function will perform a get_operation to reorder the encrypted samples to get the decrypted speech file; these operations will be implemented based on the generated secret indices key. The Put and get operations will affect the speech file by recording the samples keeping the histograms of the speech files (source, encrypted, and decrypted) the same and without any changes. The secret key generation phase will be analyzed for efficiency purposes, and two methods will be presented: The first one will use the chaotic logistic map model to generate the secret indices key, while the second method will use a selected secret image to generate the secret indices key, both methods will be tested and examined to give some recommendations for the users. Each of the introduced methods will provide a high level of security, the private keys will provide a huge key space and they will be very sensitive to resist any hacking attacks. The quality, sensitivity, security, and speed of the proposed methods will be examined, the method will be tested and implemented, and the obtained results will be analyzed to prove the achievements provided by the proposed method.

To mitigate side-channel attacks, real-world implementations of public-key cryptosystems adopt state-of-the-art countermeasures based on randomization of the private or ephemeral keys. Usually, for each private key operation, a “scalar blinding” is performed using 32 or 64 randomly generated bits. Nevertheless, horizontal attacks based on a single trace still pose serious threats to protected ECC or RSA implementations. If the secrets learned through a single-trace attack contain too many wrong (or noisy) bits, the cryptanalysis methods for recovering remaining bits become impractical due to time and computational constraints. This paper proposes a deep learning-based framework to iteratively correct partially correct private keys resulting from a clustering-based horizontal attack. By testing the trained network on scalar multiplication (or exponentiation) traces, we demonstrate that a deep neural network can significantly reduce the number of wrong bits from randomized scalars (or exponents).When a simple horizontal attack can recover around 52% of attacked multiple private key bits, the proposed iterative framework improves the private key accuracy to above 90% on average and to 100% for at least one of the attacked keys. Our attack model remains fully unsupervised and excludes the need to know where the error or noisy bits are located in each separate randomized private key.

Gradient-based non-dominated sorting genetic algorithm II (G-NSGA-II) is successful for solving multi-objective optimization problems. However, the effectiveness of gradient-based hybrid operator is influenced by the distribution of individuals in the population. In order to solve the problem, based on the framework of G-NSGA-II, we propose an improved gradient-based NSGA-II algorithm by introducing a new chaotic map model named IG-NSGA-II. In this algorithm, a new hybrid chaotic map model is first established to initialize population for keeping the diversity of the initial population. Then, the substitution operation of chaotic population candidate is introduced to maintain the diversity and uniformity of the Pareto optimal solution set. Finally, the proposed algorithm is tested on several standard test problems and compared with other algorithms. The experimental results indicate that the proposed algorithm leads to better performance results in terms of the convergence to Pareto front or the diversity of the obtained non-dominated solutions.

A chaotic map model with infinite collapses in the finite region is proposed in this paper. The scheme of generating chaotic signals from this model is analyzed. Lyapunov exponents of the map calculated indicates that it has good properties of chaos. The CDMA spreading sequences produced by the model can achieve better autocorrelation and crosscorrelation characteristics than Gold sequences usually used.

In this paper, a discrete model of memristor is adopted and analyzed. The new discrete maps are built by introducing this discrete memristor model into a two-dimensional discrete map. Interestingly, introducing this discrete memristor model from different locations can lead to two new chaotic map models. The dynamical behaviors of the two maps are studied by means of bifurcation diagrams, phase diagrams and Lyapunov exponential spectra (LEs). The simulation results show that both chaotic systems have rich dynamical behaviors. In addition, they are experimentally found to have multi-stable properties, where the M-XM map has infinite attractors coexistence. Finally, we complete the hardware implementation of the two maps based on Digital Signal Processing (DSP) platform for the application of discrete chaotic systems.

The main purpose of the proposed image encryption (IE) method is to enhance various security characteristics to protect sensitive images on the internet. In the literature, chaotic maps are preferred for image encryption because of their high randomness and sensitivity to initial parameter values. Therefore, metaheuristic algorithms have been utilized to fine-tune the parameters. In this research, we have employed the metaheuristic Lyrebird optimization (LO) algorithm to fine-tune the chaotic map parameters. The LO algorithm is chosen over other algorithms due to its better exploration and exploitation rate to search for the best solution. The LO algorithm searches for the best parameter value based on the objective function. This research involves the formulation of a multi-objective function that incorporates numerous security parameters, namely, entropy and correlation coefficient (CC), to improve the security attributes of the IE model. The proposed IE model has two steps. In the first step, a random key is generated to transform the pixels of the secret image, whereas in the second step, the image pixels are shuffled based on the shuffling index values to reduce the correlation among the neighboring pixels. In both steps, we have used the chaotic logistic map. The proposed IE is evaluated against statistical and differential attacks on the standard dataset by considering the various images and their different resolutions. The uniform distribution of the histogram of the encrypted images is validated using the chi-square test. Besides that, entropy analysis shows that the average entropy value is 7.9973, 7.9993, and 7.9998 for 256x256, 512x512, and 1024x1024 image resolutions. The average CC and SSIM are near zero value. The average NPCR value (>0.9969) is near the 1 value. Finally, the comparative analysis based on entropy, CC, and NPCR parameters shows that the proposed IE model outperforms the existing models.

Blockchain is an up-and-coming technology, and it is exploring its existence in all our day-to-day lives, particularly for business applications. Due to this, security has become a major and a higher priority concern during the transaction process of data, cryptocurrency, etc. Achieving integrity, authentication, and non-repudiation with blockchain technology through digital signatures are the factors for its success. Hence, we imply a novel hybrid chaotic map–based proactive RSA/digital signature scheme for a better securable transaction of blocks compared to earlier works. Faster encryption and decryption could be expected by this novel approach. This could surely be resistant to brute force attacks, chosen plain text attacks and chosen cipher text attacks. OPENMP and OPENSSL libraries could be employed for good performance and security in a multicore platform. Chaotic map theory has its unique characteristics in the design of highly secure asymmetric encryption and decryption processes, with lesser computational cost in lesser time. The strength of RSA lies in the prime factorization of larger prime numbers in the generation of public and private keys. RSA has a severe backlog in computational time; while the length of the prime number is longer, to ensure higher security, the longer one is preferable. Hence to speedup the factorization process, chaotic mapping theory has been synchronized with the RSA cryptosystem. Second, chaotic mapping theory provides an enhanced avalanche effect, which leads to a two-factor RSA encryption process. Chaotic maps are highly sensitive to initial values and control parameters. The unique feature of inclusion of chaotic maps is that any slight change in the initial conditions of the plain text would cause a remarkable deviation in the message digest. This nature would make the hacker limit their prediction ability. Computational time, cost, and level of resistance to attacks are the factors to be considered to measure the efficiency of our new approach when compared to other RSA approaches. The work was simulated using MATLAB and it is proved that that the proposed RSA with hybrid GLT chaotic maps is 1.53 times and 1.27 times faster than the existing ones.

A novel image steganography method using chaotic map and human visual model is presented in DCT domain. Firstly each 8×8 image block is performed Discrete Cosine Transform, then the location of image block that is embedded secret message is determined by the chaotic map. Finally the secret message is embedded adaptively in the usable middle frequency coefficient pairs judged by Just Noticeable Difference(JND). Simulation results show that the algorithm has a high capacity and a good invisibility, moreover it is robust for the common image processing like JPEG compression and cropping.

This paper presents a new digital watermarking method based on chaotic maps. Different from most of the existing chaotic watermarking methods, two chaotic maps are incorporated into the watermarking system to resolve the finite word length effect and to improve the system's resistance to attacks. One map is used for watermark generation, another as the private key. Simulation results show that the proposed digital watermarking system is feasible and robust to common signal processing procedures. In addition, it performs better than existing watermarking schemes and exhibits better protection than watermarking systems using only one chaotic map

Recently, due to the initial sensitivity, ergodicity, boundedness, and unpredictability of chaos, it has been widely used in the fields of secure communication, signal processing, chaotic synchronization, etc. Moreover, due to the low complexity of hardware implementation, widespread attention to one-dimensional (1D) chaotic maps has been paid from researchers. However, some existing 1D maps have simple chaotic behaviors and discrete chaotic intervals, which have significantly affected the practical application. To address these shortcomings, this paper proposes a 1D chaotic model based on the absolute value function and the cosine function called the cosine-coupled chaotic model (CCCM). It can use existing 1D chaotic maps as seed maps to construct a series of 1D chaotic maps with continuous chaotic intervals and complex chaotic behaviors. To verify the effectiveness of the CCCM, we first generate three new chaotic maps using the CCCM, and then their chaotic properties are analyzed by using various measures including Lyapunov exponent (LE), sample entropy (SE), correlation dimension (CD), 0-1 test and sensitivity. The experimental results confirm that the new chaotic maps have wider chaotic intervals and more complex chaotic behaviors than the corresponding seed maps and some other advanced chaotic maps. Then we use a field programmable gate array (FPGA) as the hardware platform for simple hardware implementations of the new chaotic maps. And a new pseudo-random number generator (PRNG) is introduced to verify practical applications of the new maps. Finally, experimental results show that the new chaotic maps can be implemented on FPGA and the proposed PRNG has strong random properties.

This paper contrasts the implementation of several chaos-based digital image watermarking techniques in terms of imperceptibility, robustness, security and complexity. Most spatial and transform domains methods have been used namely Least Significant Bit (LSB), Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Redundant Discrete Wavelet Transform (RDWT) with Singular Value Decomposition (SVD) mathematical tool which has enhanced embedding capability. Both continuous and discrete chaotic maps namely Arnold's Chaotic Map (ACM), Logistic Chaotic map (LCM) and Lorenz Chaotic Map (LoCM) are included to result in secure schemes. Exhaustive series of tests have been performed along with a range of evaluation metrics for imperceptibility evaluation. In addition, Robustness of all the techniques has also been confirmed by applying a variety of attacks on the resulting images. This study will help to adopt the most suitable methods for a given application as sufficient number of test images have been utilized.

A new model, combining intermittency and sawtooth chaotic maps, is presented for aggregate packet traffic streams. The intermittency map models the ON-OFF activity of the aggregate process, and the sawtooth map models the batch size when active. Results show that the model accurately reflects the impact of long range dependent traffic behaviour on queueing performance, while reducing the computational burden for simulation.

In resource-constrained communication environments, important image data needs to be compressed before encrypted transmission. This paper proposes effective solutions to this issue. Firstly, a new one-dimensional discrete chaotic system model was constructed based on the logistic system and fractional structure. Through theoretical analysis combined with numerical simulation experiments, it has been proven that the proposed new system has excellent chaotic characteristics. Compared with some traditional one-dimensional chaotic systems, the new system has a wider range of chaotic parameters and stronger complexity, making it more suitable for image data encryption. Secondly, a high-compression-ratio image compression method based on improved lifting wavelet transform and a fast image encryption algorithm based on the new chaotic map are proposed. Simulation experiments and security analysis results show that the proposed image compression–encryption scheme has excellent performance and less time overhead. It has good resistance to various cryptanalysis attacks and strong robustness to noise and data loss attacks, which indicates that the proposed image compression–encryption scheme has good application potential in resource-constrained communication environments. The main contribution of this article is the design of a new chaotic system model with practical performance and the development of a new application case. The main novelty of this paper is the proposal of a fast algorithm for high compression ratio and encryption of images.

This paper presents a multiple keys method of image encryption on chaotic maps. Different from other existing methods, two chaotic maps and multiple keys are used to encrypt the image. Firstly, the Arnold map permutes the image as preprocessing using the 1 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">st</sup> key, and then the permuted image is divided into non-overlap n*n blocks which are permuted by random sequences whose random seed is created by logistic map whose initial value and parameters are the 3 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">rd</sup> keys, and the size of block can be considered as 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">nd</sup> key. At last the obtained results XOR with the binary result created by logistic map the initial value of which is the 4 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sup> keys. The experiments prove that the scheme is robust to the signal processing procedure such as noise, compression and have a super security.