Joint Encryption Scheme Research Articles

High-Security Multi-Level Joint Encryption Scheme Based on SCMA Chaotic Codebook and OCDM Subcarrier Disturbance

High-Security Multi-Level Joint Encryption Scheme Based on SCMA Chaotic Codebook and OCDM Subcarrier Disturbance

Cross-plane multi-image encryption using chaos and blurred pixels

While studying remote sensing images, it is found that the band of remote sensing images can be used as a carrier to store different images. Therefore, this paper proposes a novel joint encryption scheme for multiple images of different sizes and types. Due to the high time efficiency of multi-image joint encryption, we propose a 1D-SASCS chaotic system, which can effectively solve the problem of time efficiency of encryption. Before encryption, we blur the pixels of several images (i.e. binary scrambling), scramble any two of the 8 bits, and fill the scrambled information into a smaller size image by splicing every 8 bits into a pixel, The bit plane pixels before and after scrambling are spliced into random size images, which are combined with SHA-512 to generate keys, and then three-dimensional cross-plane scrambling and unconventional sequence diffusion are carried out. At the same time, this algorithm is also applicable to the encryption of single or multiple remote sensing images. Finally, through the simulation experiment analysis of the encryption scheme, the test results of information entropy, Histogram, and correlation are very close to the ideal value. The algorithm is extremely secure in a large number of test performance analysis results.

Dynamic and efficient joint encryption scheme in the plain public key model

In this paper, we propose a joint encryption scheme (JES) based on discrete logarithms in the plain public key model, in which a sender can easily encrypt messages under the public keys of a group of recipients, so that only by collaborating together can all the recipients recover messages. Neither the size of the ciphertext nor the encryption computation depends on the number of the recipients. We show that the JES scheme is semantically secure against adaptive chosen ciphertext attacks in the random oracle model under the assumption of Computational Diffie–Hellman problems.