7 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 7 / 7
Yayın Cryptanalysis of Fridrich's chaotic image encryption(World Scientific Publishing, 2010-05) Solak, Ercan; Çokal, Cahit; Yıldız, Olcay Taner; Bıyıkoğlu, TürkerWe cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret permutation that is used to shuffle the pixels of a round input. We demonstrate the effectiveness of our attack with examples and simulation results. We also show that our proposed attack can be generalized to other well-known chaotic image encryption algorithms.Yayın Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps(Elsevier Science BV, 2008-11-17) Solak, Ercan; Çokal, CahitRecently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the algebraic dependencies among system parameters. we show that its effective key space can be shrunk. We demonstrate a chosen-ciphertext attack that reveals a portion of the key.Yayın Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)](American Institute of Physics Inc., 2008-09) Solak, Ercan; Çokal, CahitIn this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can remedy some of the problems we identified.Yayın Cryptanalysis of a chaos-based image encryption algorithm(Elsevier Science BV, 2009-03-30) Çokal, Cahit; Solak, ErcanA chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and known-plaintext attacks, we show that all the secret parameters can be revealed.Yayın Security of chaotic cryptosystems(Işık Üniversitesi, 2008) Çokal, Cahit; Solak, Ercan; Işık Üniversitesi, Fen Bilimleri Enstitüsü, Bilgisayar Mühendisliği Yüksek Lisans ProgramıIn this thesis, we tried to show the weaknesses of chaotic cryptosystems. We break four chaos-based cryptosystems and proved our attacks. In our first cryptanalysis, we broke a cryptosystem based on two dimensional chaotic maps. We first reveal a portion of the secret key using a chosen-ciphertext attack. After revealing this portion, we used it to reveal the other portions of the secret key. We developed three types of attack using algebraic properties of the permutations in revealing the rest. We finally published two papers for this break. In our second cryptanalysis, we broke a cryptosystem that encrypts and decrypts images with chaotic map lattices. Here we first show that the encryption algorithm is not invertible for some cases. We showed why these cases not work, and gave some suggestions to improve the algorithm. However, we showed that the algorithm still is not invertible due to finite precision arithmetic. Furthermore, we gave some suggestions to develop the algorithm. At the end of our work, we gave a break for the modified algorithm. Finally, we published a comment for the wrong cases. In our third cryptanalysis, we broke a chaos-based image encryption algorithm, which uses a two-dimensional chaotic map to shuffle the image pixels and a threedimensional chaotic map to change the gray levels of the pixels. We used a chosenplaintext attack and a known-plaintext attack to break the algorithm. Applying either our chosen-plaintext attack or our known-plaintext attack the cryptosystem yields the secret parameters successfully. We published a paper for this break. Our final cryptanalysis was on an image encryption algorithm based on twodimensional chaotic maps. We showed that the chaotic map can be revealed using a chosen-ciphertext attack. The attack does not depend on which type of map is used. The attack uses some algebraic properties of permutations and graphs.Yayın Algebraic break of a cryptosystem based on discretized two-dimensional chaotic maps(Elsevier Science BV, 2009-03-30) Solak, Ercan; Çokal, CahitRecently, a cryptosystem based on two-dimensional discretized chaotic maps was proposed [T. Xiang, et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we cryptanalyze the proposal using algebraic methods. We give three different attacks that yield all the secret parameters of the cryptosystem.Yayın Algebraic break of image ciphers based on discretized chaotic map lattices(Elsevier Science Inc, 2011-01-01) Solak, Ercan; Çokal, CahitIn this paper, we provide an algebraic cryptanalysis of a recently proposed chaotic image cipher. We show that the secret parameters of the algorithm can be revealed using chosen-plaintext attacks. Our attack uses the orbit properties of the permutation maps to deduce encryption values for a single round. Once a single round encryption is revealed, the secret parameters are obtained using simple assignments.
