Plaintext-aware encryption

About: Plaintext-aware encryption is a research topic. Over the lifetime, 1980 publications have been published within this topic receiving 101775 citations. The topic is also known as: Plaintext awareness.

Image encryption based on singular value decomposition

Abstract: Image encryption is one of the most methods of info rmation hiding. A novel secure encryption method fo r image encryption is presented in this study. The pr oposed algorithm based on using singular value decomposition SVD. In this study we start to scramb le the image data according to suggested keys (two sequence scrambling process with two different keys ) to finally create two different matrices. The dia gonal matrix from the SVD will be interchanged with the r esulted matrices. Another scrambling and diagonal matrices interchange will apply to increase the com plexity. The resulted two matrices combine to one matrix according to predefined procedure. The encrypted image is a meaningfull image. The suggested method tested with many images encryption and gives promised results.

Image encryption with an improved cryptosystem based on a matrix approach

Abstract: This paper carries out the image encryption with a revised and modified cryptosystem based on a rule-90 cellular automaton. For this purpose, we used an appropriate and convenient matrix approach to implement the main components of the encryption system, two indexed families of permutations and a pseudo-random bit generator. Furthermore, we modify the encryption scheme for improving its security. This makes our encryption proposal resist some common attacks, e.g. chosen plain-text attack, and the encryption and decryption processes are performed in a flexible way. Also, some security aspects of the cryptosystem are evaluated with a series of statistical tests exhibiting good results. It is believed that this proposal fits naturally in the present digital technology and is capable of achieving high levels of performance.

A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations

Abstract: This paper proposes a new public-key cryptosystem based on the difficulty of solving a system of nonlinear equations. The proposed cryptosystem has the following features: 1) The public-key is a nonlinear transform from a plaintext to a ciphertext in the form of rational functions. 2) The complexity of both encryption and decryption is O(m2), where m is the plaintext length. 3) Digital signature is possible. The two previously proposed systems based on the matrix decomposition and the squared matrix are special cases of the proposed system. The reliability of the cryptosystem when nonlinearity is limited to the polynomial form is discussed. Next, a publickey cryptosystem based on the difficulty of solving a system of nonlinear equations with rational functions is proposed, its decryption algorithm is studied, and the conditions for this cryptosystem to ensure reliability are derived. Finally, the computational complexity of encryption and decryption, the description volume of public and secret keys, and the possibility of digital signature are studied.