Topic
Cipher
About: Cipher is a research topic. Over the lifetime, 9409 publications have been published within this topic receiving 110309 citations. The topic is also known as: cypher & cryptographic algorithm.
Papers published on a yearly basis
Papers
More filters
TL;DR: The detailed analyses and discussions on the above problems show that the proposed chaotic cipher is insecure and unpractical.
Abstract: Recently S. Papadimitriou et al. have proposed a new probabilistic encryption scheme based on chaotic systems. In this letter, we point out some problems with Papadimitriou et al.'s chaotic cryptosystem: (1) the size of the ciphertext and the plaintext cannot simultaneously ensure practical implementation and high security; (2) the estimated number of all possible virtual states is wrong; (3) the practical security to exhaustive attack is overestimated; (4) the fast encryption speed is dependent on the first defect; (5) problems about the dynamical degradation of digital chaotic systems; (6) no explicit indications are given to explain how to construct the virtual state space with the 2^d virtual attractors, the 2^e virtual states and the permutation matrix P. The detailed analyses and discussions on the above problems show that the proposed chaotic cipher is insecure and unpractical. Also, we give our suggestions on the design of general digital chaotic ciphers, and give some open topics in this area.
54 citations
23 Aug 1998
TL;DR: The first proof that composition actually increases the security of constructions corresponding to double and (two-key) triple DES is obtained, and it is shown that meet in the middle is the best possible generic attack against the double cipher.
Abstract: We investigate, in the Shannon model, the security of constructions corresponding to double and (two-key) triple DES. That is, we consider \(F_{k_1 } (F_{k_2 } ( \cdot ))\) and \(F_{k_1 } (F_{k_2 }^{ - 1} (F_{k_1 } ( \cdot )))\) with the component functions being ideal ciphers. This models the resistance of these constructions to “generic” attacks like meet in the middle attacks. We obtain the first proof that composition actually increases the security in some meaningful sense. We compute a bound on the probability of breaking the double cipher as a function of the number of computations of the base cipher made, and the number of examples of the composed cipher seen, and show that the success probability is the square of that for a single key cipher. The same bound holds for the two-key triple cipher. The first bound is tight and shows that meet in the middle is the best possible generic attack against the double cipher.
54 citations
TL;DR: In this paper, a color image cryptosystem based on improved genetic algorithm and matrix semi-tensor product (STP) is introduced, which is composed of five stages, preprocessing, DNA encoding, crossover, mutation and DNA decoding.
54 citations
54 citations
TL;DR: Theoretical analysis and experimental results both show that the proposed scheme has prominent cryptographic performances and can resist the common attacks effectively, which is very suitable for image encryption.
54 citations