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 using random pixel permutation by chaotic mapping

Abstract: With the fast evolution of digital data exchange, security of information becomes much important in data storage and transmission. Due to the increasing use of images in industrial processes, it is essential to protect confidential images from unauthorized access. We have proposed a new image encryption algorithm using random pixel permutation based on chaos logistic maps and prime modulo multiplicative linear congruential generators. The random-like nature of chaos is effectively spread into the encrypted image through permutation and transformation of pixels in the plain image. The pixel transformation results in the encryption scheme being resistive to cryptanalytic attacks. Simulation results show high sensitivity to key, plaintext and cipher text changes. From a cryptanalytic point of view, the scheme is highly resistive to known/chosen plaintext and cipher text attacks. The proposed technique gives good parametric and sensitivity results proving itself an eligible candidate for image encryption. Moreover it is a lossless encryption technique and hence apt for securing medical and military image.

A Statistical Attack of the FEAL-8 Cryptosystem

Abstract: This paper presents a chosen plaintext cryptanalysis of the FEAL-8 cryptosystem. The attack requires the ciphertext corresponding to approximately 10000 pairs of 64 bit plaintext blocks. The difference (bitwise xor) between the two blocks of each pair is equal to an appropriately selected constant. We first state that some differential statistics for intermediate values of the data randomizer are non uniform and independent of the encryption key. We then show that these statistics can be used to compute gradually the expanded key of the data randomizer.In 1989 some announcements were made that the so-called FEAL-8, 8 round version of the FEAL cryptosystem, was vulnerable to a chosen plaintext attack [1], So far, however, only the cryptanalysis of the 4 round version FEAL-4 by Bert Den Boer [2] was published. In this paper we present a chosen plaintext attack of FEAL-8 based on some differential statistics of its data randomization scheme.

Improvement of an Encryption Scheme for Binary Images

Abstract: Chung and Chang proposed an encryption scheme for binary images based on two-dimensional run-encoding (2DRE) and scan patterns. In this paper, we indicate that their scheme is still not secure and efficient enough. Hence, an improvement scheme is proposed. There are two contributions in the proposed improvement scheme. One is to exchange the sequence of compression and encryption. The other is to adopt XOR and substitution operations for encryption. Hence, the improvements on encryptio n time, compression ratio and security are possible.

An efficient variant of the RSA cryptosystem.

Abstract: We describe an efficient combination of two variants of RSA cryptosystem (MPrime and Rebalanced RSA) analysed by Boneh and Schacham [2]. The decryption process resultant is (for 2048-bits moduli) about 8 times faster than that presented by Quisquater and Couvreur [9] and about 27 times faster than original cryptosystem.

Performance analysis of a selective encryption algorithm for wireless ad hoc networks

Abstract: Symmetric key algorithms are a typically efficient and fast cryptosystem, so it has significant applications in many realms. For a wireless ad hoc network with constraint computational resources, the cryptosystem based on symmetric key algorithms is extremely suitable for such an agile and dynamic environment, along with other security strategies. In this paper, we introduce the concept of selective encryption into the design of data protection mechanisms. First, we present the principle of selective encryption and propose a probabilistically selective encryption algorithm based on symmetric key. By utilizing probabilistic methodology and stochastic algorithm, a sender includes proper uncertainty in the process of message encryption, so that only entrusted receiver can decrypt the ciphertext and other unauthorized nodes have no knowledge of the transmitted messages on the whole. In addition, we also employ other security mechanisms to enhance the security of our proposed scheme. Eventually, we carry out an extensive set of simulation experiments based on ns2 simulator, and our simulation indicates that the technique of selective algorithms can indeed improve the efficiency of message encryption.