An Image Encryption Algorithm Based on BP Neural Network and Hyperchaotic System

To reduce the bandwidth and storage resources of image information in communication transmission, and improve the secure communication of information. In this paper, an image compression and encryption algorithm based on fractional-order memristive hyperchaotic system and BP neural network is proposed. In this algorithm, the image pixel values are compressed by BP neural network, the chaotic sequences of the fractional-order memristive hyperchaotic system are used to diffuse the pixel values. The experimental simulation results indicate that the proposed algorithm not only can effectively compress and encrypt image, but also have better security features. Therefore, this work provides theoretical guidance and experimental basis for the safe transmission and storage of image information in practical communication.

A realizable quantum encryption algorithm for qubits

A realizable quantum encryption algorithm for qubits is presented by employing bit-wise quantum computation. System extension and bit-swapping are introduced into the encryption process, which makes the ciphertext space expanded greatly. The security of the proposed algorithm is analysed in detail and the schematic physical implementation is also provided. It is shown that the algorithm, which can prevent quantum attack strategy as well as classical attack strategy, is effective to protect qubits. Finally, we extend our algorithm to encrypt classical binary bits and quantum entanglements.

A self-cited pixel summation based image encryption algorithm

In this paper, a novel image encryption algorithm is presented based on self-cited pixel summation. With the classical mechanism of permutation plus diffusion, a pixel summation of the plain image is employed to make a gravity influence on the pixel positions in the permutation stage. Then, for each pixel in every step of the diffusion stage, the pixel summation calculated from the permuted image is updated. The values from a chaotic sequence generated by an intertwining logistic map are selected by this summation. Consequently, the keystreams generated in both stages are dependent on both the plain image and the permuted image. Because of the sensitivity of the chaotic map to its initial conditions and the plain-imagedependent keystreams, any tiny change in the secret key or the plain image would lead to a significantly different cipher image. As a result, the proposed encryption algorithm is immune to the known plaintext attack（KPA） and the chosen plaintext attack（CPA）. Moreover, experimental simulations and security analyses show that the proposed permutationdiffusion encryption scheme can achieve a satisfactory level of security.

Lossless embedding: A visually meaningful image encryption algorithm based on hyperchaos and compressive sensing

A novel visually meaningful image encryption algorithm is proposed based on a hyperchaotic system and compressive sensing(CS), which aims to improve the visual security of steganographic image and decrypted quality. First, a dynamic spiral block scrambling is designed to encrypt the sparse matrix generated by performing discrete wavelet transform(DWT)on the plain image. Then, the encrypted image is compressed and quantified to obtain the noise-like cipher image. Then the cipher image is embedded into the alpha channel of the carrier image in portable network graphics(PNG) format to generate the visually meaningful steganographic image. In our scheme, the hyperchaotic Lorenz system controlled by the hash value of plain image is utilized to construct the scrambling matrix, the measurement matrix and the embedding matrix to achieve higher security. In addition, compared with other existing encryption algorithms, the proposed PNG-based embedding method can blindly extract the cipher image, thus effectively reducing the transmission cost and storage space. Finally, the experimental results indicate that the proposed encryption algorithm has very high visual security.

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.

Algebraic Cryptanalysis of GOST Encryption Algorithm

This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general idea of algebraic analysis is based on the representation of initial encryption algorithm as a system of multivariate quadratic equations, which define relations between a secret key and a cipher text. Extended linearization method is evaluated as a method for solving the nonlinear sys- tem of equations.

Fortifying Healthcare Data Security in the Cloud:A Comprehensive Examination of the EPM-KEA Encryption Protocol

A new era of data access and management has begun with the use of cloud computing in the healthcare industry.Despite the efficiency and scalability that the cloud provides, the security of private patient data is still a majorconcern. Encryption, network security, and adherence to data protection laws are key to ensuring the confidentialityand integrity of healthcare data in the cloud. The computational overhead of encryption technologies could leadto delays in data access and processing rates. To address these challenges, we introduced the Enhanced ParallelMulti-Key Encryption Algorithm (EPM-KEA), aiming to bolster healthcare data security and facilitate the securestorage of critical patient records in the cloud. The data was gathered from two categories Authorization forHospital Admission (AIH) and Authorization for High Complexity Operations.We use Z-score normalization forpreprocessing. The primary goal of implementing encryption techniques is to secure and store massive amountsof data on the cloud. It is feasible that cloud storage alternatives for protecting healthcare data will become morewidely available if security issues can be successfully fixed. As a result of our analysis using specific parametersincluding Execution time (42%), Encryption time (45%), Decryption time (40%), Security level (97%), and Energyconsumption (53%), the system demonstrated favorable performance when compared to the traditional method.This suggests that by addressing these security concerns, there is the potential for broader accessibility to cloudstorage solutions for safeguarding healthcare data.

Image Encryption and Decryption Based on Chaotic Algorithm

This paper analyzes the problems in image encryption and decryption based on chaos theory. This article introduces the application of the two-stage Logistic algorithm in image encryption and decryption, then by information entropy analysis it is concluded that the security of this algorithm is higher compared with the original image;And a new image encryption and decryption algorithm based on the combination of two-stage Logistic mapping and M sequence is proposed. This new algorithm is very sensitive to keys;the key space is large and its security is higher than two-stage Logistic mapping of image encryption and decryption technology.

Analysis and Design for Unsymmetrical Block Encryption Algorithm

This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.

Reconfigurable implementation of AES algorithm IP core based on pipeline structure

In order to improve the data throughput of the advanced encryption standard （AES） IP core while reducing the hardware resource consumption and finally achieving a tradeoff between speed and area, a mixed pipeline architecture and reconfigurable technology for the design and implementation of the AES IP core is proposed. The encryption and decryption processes of the AES algorithm are achieved in the same process within the mixed pipeline structure. According to the finite field characterizations, the Sbox in the AES algorithm is optimized. ShiftRow and MixColumn, which are the main components in AES round transformation, are optimized with the reconfigurable technology. The design is implemented on the Xilinx Virtex2p xc2vp20-7 field programmable gate array （FPGA） device. It can achieve a data throughput above 2.58 Gbit/s, and it only requires 3 233 slices. Compared with other related designs of AES IP cores on the same device, the proposed design can achieve a tradeoff between speed and area, and obtain satisfactory results in both data throughput and hardware resource consumption.

A Complex Encryption System Design Implemented by AES

With the rapid development of internet technology and the increasing popularity of e-commerce, data encryption technology plays a very important role in data security. Information security has two aspects: security protocol and cryptographic algorithm and the latter is the foundation and core technology of information security. Advanced Encryption Standard (AES) encryption algorithm is one of the most commonly used algorithms in symmetric encryption algorithms. Such algorithms face issues when used in the context of key management and security functions. This paper focuses on the systematic analysis of these issues and summarizes AES algorithm implementation, comprehensive application and algorithm comparison with other existing methods. To analyze the performance of the proposed algorithm and to make full use of the advantages of AES encryption algorithm, one needs to reduce round key and improve the key schedule, as well as organically integrate with RSA algorithm. Java language is used to implement the algorithm due to its large library, then to show the efficiency of the proposed method we compare different parameters, such as encryption/decryption speed, entropies and memory consumption...) with a classic algorithm. Based on the results of the comparison between AES and the hybrid AES algorithm, the proposed algorithm shows good performance and high security. It therefore can be used for key management and security functions, particularly for sharing sensitive files through insecure channel. This analysis provides a reference useful for selecting different encryption algorithms according to different business needs.

Phase retrieval algorithm for optical information security

As a typical technology for optical encryption,phase retrieval algorithms have been widely used in optical information encryption and authentication systems.This paper presents three applications of two-dimensional(2D)phase retrieval for optical encryption and authentication:first,a hierarchical image encryption system,by which multiple images can be hidden into cascaded multiple phase masks;second,a multilevel image authentication system,which combines(t,n)threshold secret sharing(both t and n are positive integers,and t≤n)and phase retrieval,and provides both high-level and low-level authentication;and finally,a hierarchical multilevel authentication system that combines the secret sharing scheme based on basic vector operations and the phase retrieval,by which more certification images can be encoded into multiple cascaded phase masks of different hierarchical levels.These three phase retrieval algorithms can effectively illustrate phase-retrievalbased optical information security.The principles and features of each phase-retrieval-based optical security method are analyzed and discussed.It is hoped that this review will illustrate the current development of phase retrieval algorithms for optical information security and will also shed light on the future development of phase retrieval algorithms for optical information security.

Dynamically Reconfigurable Encryption System of the AES

Reconfigurable computing has grown to become an important and large field of research, it offers advantages over traditional hardware and software implementations of computational algorithms. The Advanced Encryption Standard （AES） algorithm is widely applied in government department and commerce. This paper analyzed the AES algorithms with different cipher keys, adopted a novel key scheduler that generated the round key real-time, proposed a dynamically reconfigurable encryption system which supported the AES algorithm with different cipher keys, and designed the architecture of the reconfigurable system. The dynamically reconfigurable AES system had been realized on FPGA. The result proves that the reconfigurable AES system is flexible, lower cost and high security level.

Internet-Oriented Optimization Schemes for Joint Compression and Encryption

Compression and encryption are widely used in network traffic in order to improve efficiency and security of some systems.We propose a scheme to concatenate both functions and run them in a paralle pipelined fashion,demonstrating both a hardware and a software implementation.With minor modifications to the hardware accelerators,latency can be reduced to half.Furthermore,we also propose a seminal and more efficient scheme,where we integrate the technology of encryption into the compression algorithm.Our new integrated optimization scheme reaches an increase of 1.6X by using parallel software scheme However,the security level of our new scheme is not desirable compare with previous ones.Fortunately,we prove that this does not affect the application of our schemes.

基于全同态加密优化的云数据隐私保护方法

为了提升云数据的安全性,改善数据加密时间长以及加密效果较差等问题,提出一种基于全同态加密优化的云数据隐私保护方法。通过生成对抗网络模型学习原始数据中的重要特征,确保合成的数据和初始数据之间具有较高的相似度,使其能够满足差分隐私特征。引入PKI对数据所有者和用户身份认证处理,完成密钥的产生和分发,根据差分隐私特征将用户所有者的数据划分为不同类型,获取用户访问特征向量。构建全同态加密机制,同时引入代理重加密机制,通过密钥转换完成数据加密处理,最终实现云数据全同态加密优化。实验对比结果表明,上述加密方案能够快速完成数据加密处理,有效确保数据的安全性。

基于区块链加密技术的云会计数据安全探究

云会计因投入成本低、数据处理高效和业务效率高等优势而受到用户的青睐,但储在云端的数据所面临的安全问题已经成为云会计发展亟待解决的问题之一。为应对云会计数据安全问题,构建了基于区块链加密技术的云会计数据安全模型。首先,通过对云会计与区块链的回顾,明确云会计发展所面临的数据安全问题以及区块链技术与云会计融合发展的可行性;然后,引入非对称加密技术和哈希算法,以实现对云会计数据的加密安全存储和完整性检查;最后,通过分析得出区块链技术能够加强用户对其数据的控制、保障数据传输安全和增进用户与云会计服务提供商之间信任的结论。

On the Selection of Random Numbers in the ElGamal Algorithm

The EIGamal algorithm, which can be used for both signature and encryption, is of importance in public-key cryptosystems. However, there has arisen an issue that different criteria of selecting a random number are used for the same algorithm. In the aspects of the sufficiency, necessity, security and computational overhead of parameter selection, this paper analyzes these criteria in a comparative manner and points out the insecurities in some textbook cryptographic schemes. Meanwhile, in order to enhance security a novel generalization of the EIGamal signature scheme is made by expanding the range of selecting random numbers at an acceptable cost of additional computation, and its feasibility is demonstrated.