A novel visually secure image encryption scheme based on compressive sensing (CS) is proposed. Firstly, the plain image is transformed into wavelet coefficients, and then confused by a zigzag path ...and encrypted into a compressed cipher image using compressive sensing. Next, the cipher image is embedded into a carrier image, and finally a visually secure cipher image is obtained. SHA 256 hash function of the original image is generated to calculate the parameters for zigzag confusion and one-dimensional skew tent map, and the map is used to produce the measurement matrix for CS. Therefore, the proposed algorithm is highly sensitive to the plain image, and it can effectively withstand known-plaintext and chosen-plaintext attacks. Besides, our algorithm can achieve the image data security and image appearance security simultaneously, and the size of the cipher image and original image is equal, it does not require additional transmission bandwidth and storage space. Simulation results and performance analyses both demonstrate excellent encryption performance of the proposed encryption scheme.
•A visually secure image encryption scheme based on compressive sensing is proposed.•The encryption approach is highly sensitive to the plain image.•Simulation results and performance analyses verify the effectiveness of the proposed encryption algorithm.
The accurate prediction of power load is helpful to make reasonable power generation plans and scientific dispatching schemes and achieve the goal of energy saving and emission reduction.
There are ...many factors influencing the power load, and there may be a nonlinear relationship between the power load and these influencing factors. A new fractional multivariate grey Bernoulli model, referred to as MFGBM (q, r, N), is developed in this article for the short-term prediction of power load. The fractional differential equation and fractional accumulation generation are integrated into MFGBM (q, r, N). Second, this paper improves the grey wolf algorithm to better optimize many parameters in the model. The algorithm is improved by using a chaotic Tent map to optimize the initial population composition, adding inertia weights to change the position vector of the grey wolf, and introducing a nonlinear function and Lévy flight to enhance local exploitation and global exploration ability. Finally, this paper selects the daytime and nighttime power loads in Australia and takes the electricity price, humidity, and temperature as the influencing factors to validate the prediction capability of MFGBM (q, r, N). Our findings indicate that MFGBM (q, r, N) is highly applicable to short-term power system prediction.
•The multivariate grey Bernoulli model is proposed to predict short-term power load.•The improved grey wolf algorithm is proposed to avoid falling into local optimum.•3. The non-singular Caputo fractional derivative and Laplace transform are introduced.•The fractional-order operator is introduced to reduce the influence of randomness.
•Hybridize tent map with deterministic finite state machine to enhance dynamical properties.•New map has high complexity without requiring external entropy source.•New image cipher that achieves ...confusion and diffusion simultaneously in one round.•Cipher has flexible key size depending on user requirement.•Cipher achieves the image authentication.
Image encryption protects visual information by transforming images into an incomprehensible form. Chaotic systems are used to design image ciphers due to properties such as ergodicity and initial condition sensitivity. A chaos-based cipher derives its security strength from its underlying digital chaotic map, thus a more complex map leads to higher security. This paper introduces an enhancement to a tent map’s chaotic properties by hybridizing it with a deterministic finite state machine. We denote the resulting digital one-dimensional chaotic system as TM-DFSM. Chaotic analyses indicate that the new chaotic system has higher nonlinearity, sensitivity to initial condition, and larger chaotic parameter range than other recently proposed one-dimensional chaotic systems. We then propose a new image encryption scheme based on TM-DFSM, capable of performing both confusion and diffusion operations in one pass while also having a flexible key space. The encryption operations are designed to achieve maximal confusion and diffusion properties. Changing a single bit of the plainimage or secret key will result in an entirely different cipherimage. The proposed cipher has been analyzed using histogram analysis, contrast analysis, local Shannon entropy, resistance against differential cryptanalysis, and key security. Performance comparison with other recent schemes also depicts the proposed cipher’s superiority.
Image encryption has been an attractive research field in recent years. The chaos-based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption ...techniques. This paper proposes a novel image encryption scheme, which is based on the chaotic tent map. Image encryption systems based on such map show some better performances. Firstly, the chaotic tent map is modified to generate chaotic key stream that is more suitable for image encryption. Secondly, the chaos-based key stream is generated by a 1-D chaotic tent map, which has a better performance in terms of randomness properties and security level. The performance and security analysis of the proposed image encryption scheme is performed using well-known ways. The results of the fail-safe analysis are inspiring, and it can be concluded that the proposed scheme is efficient and secure.
The security of data transfer by the web and network is very important, especially in medicine. So encryption is a challenging and important task in information security. Recently, several algorithms ...have been presented for image encryption and security based on different methods, specifically based on encryption by DNA sequencing and chaotic systems. In this paper, a hybrid algorithm is presented using the tent chaotic mapping and DNA sequencing techniques. In this method first, the original image and the chaotic mapping are encrypted separately using DNA sequencing. Then, the logical XOR operator is applied to them and the encrypted image is produced using chaotic systems. Finally the average entropy for fingerprint images after encryption was obtained 7.9882. The results obtained from the conducted experiments and computer simulations indicate that the proposed method performs the encryption have a good result. The proposed system has also been evaluated against common attacks and has shown good results.
In the age of big data, border of data security has become increasingly blurred. Our privacy security is facing a new round of test. The multimedia big data especially images often carry many secrets ...or privacy information. How to ensure safety and the authorization of accessing to confidential data becomes a hot problem of urgency in image information processing and transmission. In this paper, we propose a novel symmetrical image encryption algorithm based on skew tent map. Utilizing a new chaos based Line map, the proposed algorithm is suitable for encryption of any size of image. In order to disrupt the correlations between the R, G, B components of the true color image, these three components are encrypted at bit level and operated at the same time. The proposed algorithm realizes fast encryption and decryption of both gray-scale image and color image. In addition, the algorithm can be implemented parallelly because there is no complex sub-block processing operation. Results of various analyses and numerical simulations show that the new algorithm has high security and is suitable for practical image encryption.
In this paper, a novel image encryption method based on skew tent chaotic map and permutation–diffusion architecture is proposed. In the proposed method, the P-box is chosen as the same size of ...plain-image, which shuffles the positions of pixels totally. The keystream generated by skew tent chaotic map is related to the plain-image. Statistical analysis, information entropy analysis, and sensitivity analysis to plaintext and key on the proposed scheme are provided in this paper. It can be seen that this algorithm is efficient and reliable, with high potential to be adopted for network security and secure communications.
► Chaos-based image encryption scheme with permutation–diffusion architecture. ► Shuffles the positions of image pixels totally to get high plaintext sensitivity. ► The keystream in the diffusion step depends on both the key and the plain-image. ► The algorithm has a big keyspace, good statistical performance, and high sensitivity.
This paper presents a highly secure image encryption scheme for secure image communication and storage. The scheme is based on a chaotic skew tent map and cellular automata (CA). The chaotic skew ...tent map is used as the initial vector generator for the CA which needs a 128 bit initial bit sequence to generate pseudo random number sequence (PRNS). Using the PRNS, the plain image pixels are first permuted to remove the high correlation among the adjacent pixels in the image. Then the permuted image is encrypted based on a single random number generated by the chaotic skew tent map. The chaotic skew tent map has a very large key space, on the other hand, CA generates PRNS faster than a chaotic pseudo random number generator (PRNG). Therefore, a combination of both chaotic map and CA gives a system with higher key space and faster PRNS generator. The experimental results show a good encryption effects which are capable to resist any kind of known attacks.
This paper suggests a unique image encryption scheme based on key-based block ciphering followed by shuffling of ciphered bytes with variable-sized blocks, which makes this scheme substantially ...robust compared to other contemporary schemes available. Another distinguishing feature of this scheme is the usage of variable-sized key streams for consecutive blocks. Based on the elementary cellular automata with chaotic tent map, distinct key streams are used to cipher individual blocks. In the subsequent step, the bytes of the ciphered block so obtained are further shuffled to make the scheme more diffused. The block size varies with the varying key stream, which is again dependent on the preceding key stream as well as the plain image. It needs to be mentioned that the size of the first block and the key stream are generated from a 64-byte secret key and the plain image. Values of correlation and the number of pixel change rate between the original and the encrypted images are 0.000479 and 99.620901, respectively. Both of the above results along with other relevant experimental results strongly establish the robustness of the proposed scheme.
PDF
