Research on Video Encryption Based on Compound Chaotic System

In order to improve the security in the process of audio files in Internet communication, first Construct a generating chaotic sequence of six dimensional cellular neural network model, according to the principle of RSA asymmetric encryption algorithm, proposes a location of any number as a transmission key(Coordinate key) in the chaotic sequence and using the public key and RSA encryption algorithm for it. Then the number corresponding to this key position, as the starting point of Chebyev chaotic mapping, and to generate encryption sequence. Finally encrypt the original audio and send to receiver with the transport key. In order to verify the practicability of the algorithm, we made a simulation experiment, the complexity of the test the transmission key and comparison of the original audio and the encryption audio waveform figure, and proves the feasibility of this kind of encryption algorithm through the correlation analysis, spectrum analysis and sensitivity analysis. There is the broad prospect and the important application of chaotic and RSA encryption technology.

<p>Video Encryption is widely used in many real-time applications today. Despite numerous video encryption techniques that are available today, the challenges such as time and space complexity, real time latency, scalability and vulnerability towards few attacks still exist in the research domain, however few algorithms have achieved acceptable computational complexity, but in such cases vulnerability to certain attacks (differential, statistical, plain text attack, and cipher text attacks) are still a threat to secure video transmission. To the best of our knowledge, a comprehensive but detailed systematic literature review on video encryption is needed for the researchers in the scientific community. This paper, therefore, presents a systematic literature review of 30 scientific documents extracted from platforms like scopus and web of science. The paper, comprehensively addresses, various techniques of video encryption and encoding, different evaluation parameters to testify the performance of the algorithms and discusses the challenges of the existing video encryption algorithms. After careful investigation, it has been observed the approaches which involve encryption of the video data post the same has been encoded is the most efficient and scalable approach towards video encryption. In addition, it also implies that in near future, the proposed algorithms, must be evaluated based on the various categorization of parameters illustrated in this paper.</p>

A video encryption scheme combining with advanced video coding (AVC) is presented and analyzed in this paper, which is different from the ones used in MPEG1/2 video encryption. In the proposed scheme, the intra-prediction mode and motion vector difference are encrypted with the length-kept encryption algorithm (LKE) in order to keep the format compliance, and the residue data of the macroblocks are encrypted with the residue data encryption algorithm (RDE) in order to keep low cost. Additionally, a key distribution scheme is proposed to keep the robustness to transmission errors, which assigns sub-keys to different frames or slices independently. The encryption scheme's security, time efficiency and error robustness are analyzed in detail. Experimental results show that the encryption scheme keeps file format unchanged, is secure against replacement attacks, is efficient in computing, and is robust to some transmission errors. These properties make it a suitable choice for real-time applications, such as secure IPTV, secure videoconference or mobile/wireless multimedia, etc.

Purpose: increasing the cryptographic strength level of the pseudo-random sequence generation function based on the «Kuznechik» encryption algorithm. Research methods: methods for constructing pseudo-random sequence generators using a strong cryptographic algorithm as a generation function in accordance with the recommendations of NIST SP 800-90. Methods of probability theory and mathematical statistics (statistical hypothesis testing, Pearson’s criterion), methods for estimating the entropy of a random process. Results: а method for development of the main component of the deterministic generator – the function for generating pseudo-random sequences based on the «Kuznechik» encryption algorithm (Russian encryption standard GOST R 34.12-2015) due to a number of the original algorithm modifications is proposed. Features of the algorithm allow to use it in a mode that combines the advantages of the well-known encryption modes of block ciphers (OFB and CTR encryption modes). A procedure for generating round keys and other modifications of the algorithm that increase its security while maintaining its performance have been developed and implemented. The generator operation was evaluated on the basis of the statistical properties of the output sequences (NIST SP 800-22 tests), Pearson’s χ2 criterion, and min-entropy (NIST 800-90B tests). According to the characteristics mentioned above, the proposed generation function is comparable with the reference version based on GOST 34.12-2015 «Kuznechik», but exceeds it in terms of security.

A parallel linear generator of multi-valued pseudorandom sequences, which operates under conditions of generating hardware errors caused by destructive adversary actions is proposed. The main types of modification of the pseudorandom sequence in case of adversary attack are considered. A distinctive feature of the iterative process of ensuring the reliability of computational operations is the of computational operations by representing a system of generating recurring logical formulas as a system of many-valued logic algebra functions. The subsequent realization of multivalued logic algebra functions by means of arithmetic polynomials allowed us to parallelize the process of generating multivalued pseudorandom sequences and level out the existing complexity (specificity) of cryptographic transformations of logical data types which limit the use of redundant coding methods. As a result, a solution that allows to apply redundant modular codes to control the accuracy of the computational operations performed by the nodes of pseudorandom sequence generation is proposed. Moreover, unlike the known solutions, the proposed method provides obtaining fragments of a pseudorandom sequence on the basis of one recursive arithmetic formula with parallel calculation errors control. The use of modular forms made it possible to transfer computations from the rational numbers field arithmetic to integer arithmetic of a simple field. Among the existing variety of codes correcting errors (maximally spaced codes), a special place is occupied by multivalued Reed-Solomon codes. Reed-Solomon codes usage in the formation of pseudorandom sequences allows the formation of code-like structures that monitor and ensure the reliability of computational operations. The calculated probability of failure-free operation of the parallel linear generator of multivalued pseudorandom sequences with an error control function based on the principle of functioning — sliding redundancy is obtained. The achieved results can find wide application at realization of perspective high-efficiency cryptographic information protection facility.

In this work, we investigate the two-photon absorption (TPA)-based quantum-dot semiconductor optical amplifier (QD-SOA) to simulate the encryption and decryption. Optical logic gates and pseudo-random binary sequence (PRBS) generators are realized using the TPA-based QD-SOA, and the encryption algorithm and key are based on these optical logic gates. The fast phase change due to the incorporation of TPA allows generation of keystream at high speed. Simulation results are carried out to show that encryption and decryption using PRBS based on optical logic gate are achievable.

Context. Such perfect algebraic constructions of many-valued logic as ternary bent-functions and their truth tables which are called as 3-bent-sequences, are used very often in modern cryptographic algorithms, in particular, in pseudorandom sequence generators. However, today there are no methods for synthesizing the ternary bent-functions class for a number of variables greater than two, which significantly limits the ability to scale the number of protection levels of the of pseudorandom sequence generators based on the ternary bent-functions. This circumstance generates the task of developing methods for the synthesis of ternary bent-functions, which is solved in this paper for the case of ternary bent-functions of three variables. The object of this research is the process of efficiency increasing of the cryptographic algorithms based on the functions of many-valued logic.Objective. The purpose of the paper is to construct a method for the synthesis of the set of ternary bent-functions of three variables.Method. The mathematical apparatus of the Reed-Muller transform (algebraic normal form) was used as the basis of the proposed constructive method for the synthesis of ternary bent-functions of three variables. So, on the basis of the established properties of the algebraic normal form of ternary bent-functions and limited enumeration, the search for ternary bent-functions up to affine terms is performed, after which we apply the procedure of reproduction.Results. As a result of using of the proposed method for the synthesis of ternary bent-functions of three variables, 155844 3-bentsequences were found up to an affine term, while the cardinality of the full set of found 3-bent-sequences is 12623364. The research performed made it possible to determine that in this set there are 3-bent-sequences of six different weight structures, on the basis of which 12 different triple sets can be compiled for use in pseudorandom sequence generators. A scheme for a cryptographically stable pseudorandom sequence generator based on the found set of 3-bent-sequences of length N = 27 is proposed. It is shown that the protection levels number of such a generator of pseudorandom sequences is 41 7.041 10    which is comparable with the protection levels number of modern block symmetric cryptographic algorithms, for example, AES-128.Conclusions. The further development of modern cryptographic algorithms, in particular, cryptographically stable pseudorandom sequence generators, is largely based on the use of perfect algebraic constructions of many-valued logic. For the first time, a constructive method for the synthesis of ternary bent-functions of three variables is proposed. For the found set of ternary bent-functions, the distribution of weight structures is found, and the possible triple sets are established. Based on the constructed set of ternary bentfunctions, a pseudorandom sequence generator scheme is proposed that has a protection levels number that is comparable with modern block symmetric cryptographic algorithms. We note that the constructed class of ternary bent-functions can also be used for the synthesis of cryptographically strong S-boxes, codes of constant amplitude, as well as error correction codes. As an actual area of further research, we can note the development of methods for the synthesis of ternary bent-functions of a larger number of variables.

VLC codeword concatenations are not secured in most video encryption algorithms because direct encryption of them will usually not result in valid VLC codeword concatenations, and then the encrypted video stream does not conform to standard format. So how to secure VLC codewords has become a difficult issue in video encryption. This paper presents a light-weight approach to solve this problem. In the proposed scheme, the VLC codewords of TCOEF (Transform coefficient) and MV (motion vector) are randomly substituted with other legal codeword. The substitute codewords are from the standard VLC table, thus the encrypted video stream is format-compliant as an ordinary compressed stream that can be decoded by a conventional decoder. In addition, our scheme not only encrypts the sigh bits of TCOEF and MV, but also encrypts INTRADC codewords (DC coefficients for INTRA blocks) using secret key cryptography. This can also disguise the video content more and still conform to the standard format. Therefore, the security of this scheme is significantly enhanced while the complexity overhead is slightly increased. The experimental results show that video stream can be encrypted in real-time and the video content is fully disguised.

In this paper, we proposed a new image encryption algorithm based on parameter-varied logistic chaotic map and dynamical algorithm. The parameter-varied logistic map can cure the weaknesses of logistic map and resist the phase space reconstruction attack. We use the parameter-varied logistic map to shuffle the plain image, and then use a dynamical algorithm to encrypt the image. We carry out several experiments, including Histogram analysis, information entropy analysis, sensitivity analysis, key space analysis, correlation analysis and computational complexity to evaluate its performances. The experiment results show that this algorithm is with high security and can be competitive for image encryption.

The pseudorandom sequences generation is a cryptographic systems fundamental aspect that affects cryptographic strength. One of these sequences advanced generating methods involves the use of elliptic curves (ECs), in particular by exploiting the isogeny properties of ECs. This approach not only improves the security features of cryptographic algorithms, but also ensures efficiency and reliability in the generation process. The use of isogenic transformations - morphisms between elliptic curves that preserve their group structure - further enriches the technique by introducing complex algebraic operations that are difficult to solve. Recent research has detailed the effectiveness of pseudorandom sequence generators based on elliptic curves. Methods have been developed that exploit the properties of elliptic curves over finite fields to generate sequences with low correlation and high linear complexity. There is also another approach that uses linear shift feedback registers (LFSRs) in combination with elliptic curve points to generate pseudorandom sequences. The new obtained method makes it possible to increase the number of internal states of the Dual_EC_DRBG generator by √n times, where n is the number of cyclic subgroups of simple order of the initial curve. This increases the complexity of disclosing the law of formation of the DRBG by an attacker. The application of the developed method also allows to avoid the existing disadvantages of Dual_EC_DRBG The article investigates the use of EC isogenies in the generation of pseudorandom sequences, considering their potential for improving cryptographic strength. By means of a detailed analysis of the algebraic structure and properties of these transformations, a method for PSPs generating is developed that can potentially provide advantages over existing methods in terms of security and efficiency in the transition period to post-quantum cryptography.

A power system video encryption scheme based on chaotic systems has been developed in this paper. This scheme uses 2D sine Logistic modulation mapping to scramble pixels in video frames. Then the image is divided into three layers, and diffused by a new chaotic system. Ciphertext image is added in the diffusion to enhance the security of the algorithm. Finally, the algorithm is simulated in MATLAB. By analyzing the simulation results, it is proved that the video encryption algorithm in this paper has good encryption effect and has important application value in the information transmission of power system. Finally, the application of this algorithm in video transmission of power system is expounded.

This paper presents a novel discrete memristor model that incorporates exponential and absolute value functions. A discrete coupled memristor neural network model is constructed based on this memristor design. The periodic and chaotic regions of the discrete neural network model are determined using bifurcation and Lyapunov exponent spectrum. Furthermore, by varying the initial values of the discrete memristive neural network, we observe the coexistence of chaos and periodic attractors, as well as periodic attractors. Additionally, an application to color image encryption based on the discrete system model is given. Security analysis is conducted in the aspects of key space, histogram analysis, correlation analysis, sensitivity analysis, Peak Signal-to-Noise Ratio (PSNR), and information entropy analysis. The analysis results show that the algorithm has a key space size of [Formula: see text], and the information entropy of baboon graph is 7.9993, which is very close to the ideal value of 8. It shows that the image encryption algorithm is feasible and effective. Finally, the implementation of the discrete memristive neural network model is realized using Field Programmable Gate Array (FPGA). The experimental implementation is conducted using the Verilog language on the Vivado 2018.3 platform, and the obtained results align with the numerical simulation results obtained through MATLAB.

Multiple face images encryption based on a new non-adjacent dynamic coupled mapping lattice

The H.264 video coding standard has been widely applied to multimedia data transmission. To prevent the contents of video from being recognized by someone unauthorized, providing sufficient security to H.264 has become more and more important. In this thesis, an improved H.264/AVC video encryption method is proposed. As compared with the Shahid’s method, more data are encrypted. And this makes the outcome more desirable. In the proposed scheme, selective encryption (SE) is performed in the motion vector difference (MVD), delta quantization parameter (delta QP), and the context-based adaptive variable length coding (CAVLC) modules. Owing that the encrypted stream should be decoded correctly before decryption, a format-compliant method is presented. Furthermore, in order to keep the bitrate unchanged, keeping the same stream length is another important characteristic of our proposed scheme. Since there is no escalation in bitrate, the proposed encryption algorithm is suitable for real-time multimedia streaming over heterogeneous networks. The encrypting key is generated by using the advanced encryption standard (AES) algorithm, and every frame has its own unique key. Four benchmark video sequences with different combinations of motion, texture and objects were used for experimental evaluation of the proposed scheme. The structural similarity (SSIM) index, a reference value to image quality, of the proposed scheme is 0.202 which is lower than 0.233 of the Shahid’s scheme. The key security is shown reliable under the test of only 1 bit change. The extra computation needed by our scheme is less than 0.5%, so it is feasible for real-time transmission. The above performance on security and sensitivity demonstrates that our proposed scheme is a good candidate for practical applications.

Based on the current situation, problems and coping measures of network information security in the new era of artificial intelligence and mobile Internet, this paper explores various of network security risks faced by network information, and proposes a new quantum computing reconstruction encryption system based on artificial intelligence, large model and multi-modal fusion application scenarios, as well as network protection technology architecture with the ability to defend against deep fake, which is generated by generative artificial intelligence, and gives the enhancing encryption public key generation algorithm using pseudo-random sequence and verifies the feasibility of this encryption algorithm through encryption and decryption test experiments of different communication information formats, and analyzes the security of the algorithm. The experimental results show that network communication information encryption algorithm based on pseudo-random sequence has high security and encryption efficiency, and can effectively protect the secure transmission of network information.