Scrambling Algorithm Research Articles

Hybrid Block Chaotic Compressive Sensing and Chaotic Scrambling Algorithms for Color Image Encryption System

This paper suggests a new image encryption algorithm based on block compressive sensing (BCS) and chaotic scrambling techniques. With compressive sensing (CS), signals can be sampled much lower than the Nyquist-Shannon rate while preserving their information content. BCS can be used as a one-step process by using a 3D logistic chaotic map, the measurement matrix is used as a secret key for encryption. BCS algorithm used an individual image reconstruction algorithm that leverages l_1norm minimization to promote signal sparsity, and a smoothing operator to enhance image quality. An encrypted image is first decomposed into three sub-images based on the tricolor theory; then, a discrete wavelet transform is used to sparsely process the three decomposed images. A 2D Henon map is used to scramble the compressed image after compression. This process further enhances the security of the system by increasing the complexity of the encryption process. The results showed that the proposed system provides better security and has a lower computational complexity than other methods. Furthermore, the proposed system is resistant to known attacks such as brute force and statistical attacks.

Audio encryption framework based on chaotic map and DNA encoding

In this work, an audio encryption framework is proposed based on the chaos theory and DNA encoding. Traditional encryption algorithms designed for text data might not be efficient for handling the bulk data of audio files, leading to slow processing times and increased storage requirements. Striking the right balance between robust encryption and efficient processing is crucial. Additionally, some encryption methods can introduce noise or artifacts into the audio signal, impacting its clarity. Maintaining high-fidelity audio quality while ensuring strong encryption remains an ongoing area of research. Despite these challenges, the need for secure audio communication is undeniable. The RCM chaotic map is used to introduce chaotic properties in the encryption framework. A novel pseudorandom bit generator approach is proposed and used for encryption purposes. The proposed work is a symmetric encryption approach and is completely lossless. The proposed approach uses some lightweight computational procedures that make the algorithm simple and computationally less expensive which makes it suitable for real-time applications. Furthermore, the proposed approach shows significant performance and resilience against various cryptographic attacks. A new scrambling algorithm is proposed to add a layer of security. The proposed scramble algorithm uses logistic map beside the RCM map. The proposed approach achieved 98.28 % NSCR value and 33.63 % UACI values on average. The experimental outcomes are encouraging for practical applications of the proposed approach.

A crosstalk-free multiple-image encryption scheme based on computational ghost imaging with binarized detection

Crosstalk noise is a main problem limiting the performance of multiple-image encryption (MIE) scheme. In this work, we proposed a crosstalk-free MIE scheme based on computational ghost imaging (CGI) with binarized detection. In the encryption process, the plaintext images are encrypted into intensity sequences by the CGI system and quantified into two levels to obtain binary ciphertext sequences, which does not cause severe degradation in decrypted image quality compared to traditional CGI. Then, for the binary ciphertext sequences, we can combine them into a decimal grayscale ciphertext. To enhance security, a pixel bit layer scrambling (PBLS) algorithm is designed to scramble the grayscale ciphertext to obtain the final ciphertext. In the decryption process, anyone of the plaintext images can be decrypted without being affected by other plaintext images after performing inverse PBLS algorithm on the ciphertext and extracting the binary ciphertext sequence. The effectiveness, robustness, encryption capacity and security of the proposed scheme are demonstrated by numerical simulations and theoretical analysis.

Visually meaningful image encryption scheme using multi-parameter fractal theory and block synchronous sorting diffusion

Traditional visually meaningful image encryption (VMIE) works by embedding a secret image (SI) into a visually meaningful carrier image (CAI), thus achieving the dual protection of both data information and appearance features. However, the current VMIE algorithm still suffers from problems of reconstruction quality and transmission efficiency. To address these issues, this paper proposes an innovative VMIE algorithm that utilizes a newly designed two-dimensional hyperchaotic map, multi-parameter fractal matrix (MPFM) theory and compressive sensing. The proposed algorithm achieves dual protection of both the semantic information and appearance image data. First, a newly designed 2D infinite triangle folding map (2D-ITFM) is presented to generate a binary key-controlled measurement matrix to measure and compress a plain image (PI) to generate measured image (MI) and decrease the amount of transmission information. Next, based on the hyperchaotic map 2D-ITFM and MPFM, we present the inter-block scrambling (IBS) algorithm and intra-block synchronous sorting diffusion (IBSSD) algorithm, which are used to process the MI and generate SI. Then, the matrix encoding embedding (MEE) technique is utilized to hide the SI into the CAI to produce a visually secure cipher image (CII). Finally, the experimental results demonstrate that our scheme is effective in improving the anti-attack ability while guaranteeing good imperceptibility and reconstruction performance. This scheme can be employed in the field of information security communication.

A compressive sensing encryption scheme for dual color images based on discrete memristor map and Rubik’s cube scramble

The most common in practical image encryption are multiple color images, however, less attention is paid to inter-layer correlation broken in existing color image encryption algorithms. In this paper, a 2-D compressive sensing dual color images encryption algorithm based on a discrete memristor hyper-chaotic map and Rubik's cube scramble is proposed. First, we propose a new discrete memristor-Ikeda map (DM-Ikeda), the analysis result shows the DM-Ikeda map has extremely high complexity and hyper-chaotic dynamical behavior. Second, to facilitate ciphertext transmission, the images are compressed and encrypted simultaneously by DM-Ikeda map and 2D compressive sensing. Then, we design a new rubik's cube scramble algorithm, which combines the layers of two images into a cube that can be expanded in different orders, and swaps the pixels of rows, columns or faces of each image by rotating the cube to achieve image scramble. This algorithm can break the correlation not only of pixels within layers of two images but also of pixels between different layers of images. Finally, two images are further diffused with the use of hyper-chaotic sequences. The algorithm can achieve both compression and encryption of dual color images. Experimental results indicate that, our scheme has excellent compression, and can break the correlation between different images and layers, which is excellent resistance to statistical attacks and has high security.

Image Encryption Algorithm Based on a Novel Wide-Range Discrete Hyperchaotic Map

Existing hyperchaotic systems suffer from a small parameter range and small key space. Therefore, we propose herein a novel wide-range discrete hyperchaotic map(3D-SCC) based on the mathematical model of the Sine map. Dynamic numerical analysis shows that this map has a wide-range of parameters, high sensitive, high sensitivity of sequences and good ergodicity, which proves that the system is well suited to the field of communication encryption. Moreover, this paper proposes an image encryption algorithm based on a dynamic cycle shift scramble algorithm and image-sensitive function. First, the image feature is extracted by the image-sensitive function to input into the chaos map. Then, the plaintext image is decomposed by an integer wavelet, and the low-frequency part is scrambled by a dynamic cyclic shifting algorithm. The shuffled low-frequency part and high-frequency parts are reconstructed by wavelet, and the chaotic matrix image is bitwise XOR with it to obtain the final ciphertext. The experimental results show that the average NPCR is 99.6024%, the average UACI is 33.4630%, and the average local Shannon entropy is 7.9029, indicating that the statistical properties of the ciphertext are closer to the ideal value. The anti-attack test shows that the algorithm can effectively resist cutting attacks and noise attacks. Therefore, the algorithm has great application value in the field of image encryption.

Color image encryption scheme based on the combination of the fisher-yates scrambling algorithm and chaos theory

In order to obtain a more secure and effective image encryption scheme, a color image encryption scheme based on Fisher-Yates scrambling algorithm and chaos theory is proposed. First, the (secure hash algorithm) SHA-384 is used to generate the key by combining the plaintext image and the encrypted time point. Then, three groups of chaotic sequences are obtained by iterating the three-dimensional Chen chaotic system, and three groups of pseudo-random sequences are obtained by processing with the key. The first group of pseudo-random sequences combined with the Fisher’s algorithm for image pixel position scrambling. A new pixel value substitution method is proposed using the second group of sequences to control each pixel value substitution of the image. The last group generated the matrix after pixel substitution was used for diffusion transformation to obtain the final encrypted image. The test results show that the scheme has broad application prospects.

Chaos based encryption of quantum images

Content, be it any form text, image or video, which needs to be sent from one place to another is vulnerable to third party attacks if it is sent without proper encryption. Therefore, each encryption should be extremely sensitive to change, that is a small change in the key should drastically change the cipher text. In this paper we propose such an image encryption algorithm which is extremely sensitive to such changes. A novel encryption algorithm for quantum images based on chaotic maps is designed. The image is converted into a scrambled state using quantum circuits using the principle of Quantum Hilbert Image Scrambling algorithm. The scrambled image is encrypted using the quantum XOR gate using the chaotic maps algorithm. Numerical and simulation analyses show that the proposed quantum image encryption approach is robust, realizable, and has high efficiency compared to its classical counterpart.

Voice Scrambling Algorithm based on 3D Chaotic Map System (VSA3DCS) to Encrypt Audio Files

Here, a proposed voice scrambling algorithm established on one of two 3D chaotic maps systems (VSA3DCS) will be presented, discussed, and applied on audio signals file. The two 3D chaotic map systems in which any one of them is used to build VSA3DCS are Chen's chaotic map system and Lorenz chaotic map system. Also Arnold cat map-based scrambling algorithm will be applied on the same sample of audio signals. These Scrambling algorithms are used to encrypt the audio files by shuffling the positions of signals at different conditions with the audio file as one block or two blocks. Amplitude values of audio signals with signals' time are registered and plotted for original file versus encrypted files which are produced from applying VSA3DCS using Chen's, VSA3DCS using Lorenz, and Arnold-based algorithm. The spectrogram frequencies of audio signals with signals' time are plotted for original file versus encrypted files for all algorithms. Also, the histogram of the original file and encrypted audio signals are registered and plotted. The comparative analysis is presented by using some measuring factors for both of encryption and decryption processes, such as; the time of encryption and decryption, Correlation Coefficient of original and encrypted signals between the samples, the Spectral Distortion (SD) measure, Log-Likelihood Ratio (LLR) measure, and key sensitivity measuring factor. The results of several experimental and comparative analyses will show that the VSA3DCS algorithm using Chen's or Lorenz is a good algorithm to provide an effective and safe solution to voice signal encryption, and also VSA3DCS algorithm better than Arnold-based algorithm in all results with all cases.

An Improved Arnold Image Scrambling Algorithm

In recent years, with the rapid development of the Internet, our life has undergone tremendous changes, and the Internet has become an indispensable part of us. With the popularity of the Internet, more and more people use the Internet to transmit multimedia information such as images [1]. Studies have shown that about 75% of human information from the outside world comes from the visual system, that is, from images. Image is not unfamiliar to us. However, in recent years, the security of image information in the transmission process has become increasingly prominent. Such image information as cases, design drawings and so on need to be encrypted when they are transmitted on the Internet. Scrambling technology is an image encryption technology. There are many commonly used image scrambling algorithms. This paper first introduces the image scrambling algorithm based on Arnold transform. Then, in order to improve the image scrambling performance, the application of Arnold transform matrix in image scrambling is analyzed. On this basis, a double scrambling image encryption algorithm based on two-dimensional Arnold transform is proposed. This algorithm uses two-dimensional Arnold transform at the same time. Gray scale and position scrambling [3]. The simulation results show that the improved algorithm can achieve better scrambling effect and encryption effect, which is conducive to the study of image encryption.

Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

A fast-blind IP watermark detection scheme based on position fuzzification

The rapid advancement in internet of things (IoTs) has created new demands for intellectual property (IP) protection. Existing zero-knowledge-based IP watermark detection schemes have low performance in real-time detection. To address this issue, we propose a position fuzzification-based IP watermark detection scheme mainly aiming to reduce the rounds of inquiry. Firstly, a random sequence is produced by chaos system to scramble all the resource positions of an IP design. Then watermark positions are fuzzified to make the scramble algorithm irreversible. A verifier can achieve zero-knowledge proof of IP ownership by one round of inquiry. Experiments show that the proposed scheme can greatly reduce computational complexity during blind IP watermark detection and enhance performance in real-time watermark detection.

Quantum color image watermarking based on fast bit-plane scramble and dual embedded

Most of the studied quantum encryption algorithms are based on square images. In this paper, based on the improved novel quantum representation of color digital images model (INCQI), a quantum color image watermarking scheme is proposed. First, INCQI improved from NCQI is used to represent the carrier and watermark images with the size [Formula: see text] and [Formula: see text], respectively. Secondly, before embedding, the watermarking needs to be preprocessed. That is, the watermark image with the size of [Formula: see text] with 24-qubits color information is disordered by the fast bit-plane scramble algorithm, and then further expanded to an image with the size [Formula: see text] with 6-qubits pixel information by the nearest-neighbor interpolation method. Finally, the dual embedded algorithm is executed and a key image with 3-qubits information is generated for retrieving the original watermark image. The extraction process of the watermark image is the inverse process of its embedding, including inverse embedding, inverse expand and inverse scrambling operations. To show that our method has a better performance in visual quality and histogram graph, a simulation of different carrier and watermark images are conducted on the classical computer’s MATLAB.

Image Scramble Algorithm with Robustness under Transcoding

In this work, image scramble algorithm is proposed that is robust under transcoding to recover a successfully descrambled image from a scrambled image. The transcoding schemes as such as resizing, color space conversion, color format conversion, etc. are considered as they are commonly applied in multimedia sharing Instant Messaging services (IMs) applications. To combat such transcoding, following methods are applied: MCU block shuffle scramble, restricted DCT coefficient sign randomization, restricted DCT coefficient swap within MCU block, adaptive DCT coefficient scaling and clipping depending on the image and postupdate. The resulting scrambled image yields good visual scramble effects and small increase in bitstream size compared to the original image. The scramble key, that scramble algorithm depends upon, is encrypted with the authorized user information and embedded in the scrambled image, chosen prior to transmission, to successfully descramble the scrambled image without additional servers for key management. These results allow scrambled image to be shared via IMs and descramble successfully without key management servers, thereby possibly creating new multimedia service for smartphones.

A new multiple frames decoding and frame wise measurement for compressed video sensing

Compressed sensing (CS) breaks the limit of Nyquist sampling rate and provides a new method for information sampling. Compressed video sensing (CVS) introduces CS into video codec and decreases the burden of encoding. For three-dimensional video data, the cube-based CVS scheme is an intuitive method in that CS measurements can span the entire spatial and temporal extent of a video sequence. Unfortunately, the measuring of multiple frames in video cubes simultaneously requires complex calculation and expensive spatial costs, which is largely considered impractical to implement in a real device. In this paper, a novel compressed video sensing scheme that is exactly suitable for wireless multimedia sensor networks is proposed by changing the method of processing multiple frames in video cubes. At the encoder, sampling rate redistribution (SRR) algorithm increases the measurements contained in the first and last frames so that they can assist to reconstruct intermediate frames. At the decoder, all measurements are scrambled by global measurement scrambling (GMS) algorithm to make them similar to measurements of the global CS acquisition. The experimental results show that the proposed scheme effectively improves the decoding performance on the premise of realizable hardware devices.

Simulation and FPGA Realization of Scramble Algorithm in TD-LTE System

This paper mainly realizes scramble in TD-LTE system. It includes the introduction of scrambling; projects form; the process of FPGA implementation and the results analysis. Then it finishes simulation, synthesis and verification of board on Virtex-6.The implementation of results shows that this algorithm of modulation and scramble has a high effectively and good reliability to TD-LTE RF conformance testing instrument.

Image scrambling algorithm based on cloud model

Concerning the deficiency of the digital image scrambling algorithm in double scrambling, an image scrambling algorithm based on cloud model was proposed. The algorithm used the function value generated by the three-dimensional cloud model to change the positions and values of the image pixels, to achieve a double scrambling. The experimental verification as well as quantitative and qualitative analysis show that the scrambling image renders white noise and realizes the image scrambling. There is no security issue on cyclical recovery. The algorithm can quickly achieve the desired effect, resistant to shear, plus noise, filtering and scaling attacks. This proves that the algorithm is effective and reasonable, and also can be better applied to the image scrambling.

차량 통신 기술을 위한 OFDM 모듈레이션의 64-비트 스크램블러 설계

WAVE 시스템은 IEEE 802.11p표준으로 지능형 교통시스템 서비스에 응용되는 새로운 개념 및 차량 통신 기술이다. 또한 WAVE 시스템은 도로상의 트래픽의 효율과 안전을 높인다. 그러나 WAVE 시스템의 OFDM 모듈레이션에서 스크램블러 비트 연산 알고리즘은 하드웨어나 소프트웨어 측면에서 병렬 처리가 불가능하므로 효율성이 떨어지게 된다. 본 논문에서는 스크램블러의 비트 연산으로 64비트 행렬 테이블을 구성하는 알고리즘과 64비트 행렬 테이블과 입력 데이터를 병렬 연산하는 알고리즘을 제안하였다. 제안한 알고리즘은 64비트 행렬 테이블을 적용하여 실행한 결과 비트연산 스크램블러보다 1회와 10000회 처리 속도는 약 40.08%-40.27%가 향상되고, 초당 처리 횟수는 468.35회 더 수행할 수 있고, 32비트 스크램블러보다 1회와 10000회 처리 속도는 약 7.53%-7.84%가 향상되고, 초당 처리 횟수는 91.44회 더 수행할 수 있다. 따라서 64비트로 연산하는 스크램블러 알고리즘은 64비트를 처리할 수 있는 CPU를 사용한다면 32비트 스크램블러보다 40% 이상 성능을 향상시킬 수 있다. WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

Research on the Color Digital Image Scrambling Algorithm Based on Improved Chaotic Sequences

Research on the Color Digital Image Scrambling Algorithm Based on Improved Chaotic Sequences

Multiple Blind Watermark Algorithm Based on Wavelet Packet Transform and Two-Dimensional Chaos Scramble

In this paper, multiple blind watermark algorithm based on wavelet packet transform (WPT) and two-dimensional chaos image scramble is put forward. In the sub-images of WPT, multiple watermarks are embedded and distilled blindly. Meantime, the image contrast enhancement to hidden information before hand can improve its robustness effectively. In order to improve the security, two-dimensional chaos image scramble algorithm is designed. Experimental results show that the multiple blind watermark algorithm has good invisibleness, security and robustness to common image processing and noise attack.