Topic
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.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: It is demonstrated that the optical encryption scheme with a reference wave in joint transform correlator (JTC) is vulnerable to the known-plaintext attack (KPA) from the point of view of cryptanalysis.
Abstract: We demonstrate that the optical encryption scheme with a reference wave in joint transform correlator (JTC) is vulnerable to the known-plaintext attack (KPA) from the point of view of cryptanalysis. By implementing this attack, an opponent can access the encryption key with the help of several skillful steps and a pre-knowledge of a plaintext–ciphertext pair. The theoretical analysis and a set of numerical simulations are carried out to demonstrate how the secret key of the encryption system can be derived out with our proposed strategy.
15 citations
••
TL;DR: This letter studies the security of a CS-based cryptosystem that encrypts a plaintext with a secret circulant matrix and transmits the ciphertext over a wireless channel and develops an upper bound on the entropy.
Abstract: The principle of compressed sensing (CS) can be applied to a cryptosystem in which the sensing matrix is employed for the secret key. In this letter, we study the security of a CS-based cryptosystem that encrypts a plaintext with a secret circulant matrix and transmits the ciphertext over a wireless channel. The relative entropy is considered as a security measure for the indistinguishability of the CS-based cryptosystem. By developing an upper bound on the entropy, the security analysis reveals that the presence of wireless channels and additive noise contributes to reducing the relative entropy of the cryptosystem. Consequently, the CS-based cryptosystem with circulant matrices can guarantee wireless security in terms of the indistinguishability, as long as the channel gains and the plaintext-to-noise power ratio of an adversary are kept to be low for a long keystream and a short ciphertext.
15 citations
•
31 Aug 2010
TL;DR: In this paper, a method of diversification of an iterative function of an encryption algorithm is proposed, where during an iteration at least one parameter other than an encryption key and an input message is modified.
Abstract: A method of diversification of an iterative function of an encryption algorithm. During an iteration at least one parameter other than an encryption key and an input message is modified. It is particularly advantageous that the encryption algorithm is the Advanced Encryption Standard.
15 citations
••
TL;DR: Security evaluation of a novel bilateral-diffusion image encryption algorithm based on dynamical compound chaos function and LFSR shows that the whole keystream can be broken by using two images including a chosen image and a known image, with a combination of chosen-plain text attack and known-plaintext attack.
Abstract: Recently, a novel bilateral-diffusion image encryption algorithm based on dynamical compound chaos function and LFSR was proposed. The core idea of the algorithm is to introduce the bilateral-diffusion approach. The present paper focuses mainly on security evaluation of this approach. As it is well known, the security of a cryptosystem must depend only on the secrecy of the key rather than the secrecy of the algorithm according to Kerckoff’s principle. The security of the original algorithm is determined by two initial keys. Since the keys are fixed, the chaotic keystream keeps unchanged for different images. Thus, our purpose is to reveal the keystream. The cryptanalytic results show that the whole keystream can be broken by using two images including a chosen image and a known image, with a combination of chosen-plaintext attack and known-plaintext attack.
15 citations
••
TL;DR: This paper shows that the proposed enhanced Certificate-Based Encryption scheme from pairings in the chosen-key model is semantically secure against adaptive chosen ciphertext attacks in the random oracle model under the Bilinear Diffie-Hellman (BDH) assumption.
15 citations