The Experts below are selected from a list of 4602 Experts worldwide ranked by ideXlab platform

Di Xiao - One of the best experts on this subject based on the ideXlab platform.

  • cryptanalyzing a novel image cipher based on mixed transformed logistic maps
    Multimedia Tools and Applications, 2014
    Co-Authors: Yushu Zhang, Di Xiao, Wenying Wen
    Abstract:

    Recently, a novel image cipher [Multimed Tools Appl (2012) 56:315---330] was proposed based on mixed transformed logistic maps. The cipher includes three parts: initial permutation of all the pixels with six odd keys, nonlinear diffusion using the first chaotic keystream and xoring the second chaotic keystream with the resultant values, and Zig-Zag diffusion with the third chaotic keystream. It was claimed that the nonlinear diffusion using the first chaotic map, xoring with the second chaotic map and the Zig-Zag diffusion with the third chaotic map are done to improve the security against the known/chosen Plaintext Attack. However, the cipher is insecure against chosen Plaintext Attack. In this paper, we analyze the security weakness of the cipher. As for different images, three chaotic keys keep unchanged so that three chaotic keystreams are also fixed. Our target is to reveal six odd integer keys and three chaotic keystreams equivalent to three chaotic keys. By applying chosen Plaintext Attack, we can reveal them through two different methods. Experimental results also verify our assertion.

  • vulnerability to chosen Plaintext Attack of a general optical encryption model with the architecture of scrambling then double random phase encoding
    Optics Letters, 2013
    Co-Authors: Yushu Zhang, Di Xiao
    Abstract:

    We demonstrate a new approach to chosen-Plaintext Attack on a general encryption model based on scrambling preprocessing operation and double random phase encoding (DRPE). With this Attack, an opponent can access both the scrambling key and two random phase keys. We hope that our work motivates further security analysis of the optical encryption scheme combining the scrambling techniques and DRPE.

  • cryptanalysis of s box only chaotic image ciphers against chosen Plaintext Attack
    Nonlinear Dynamics, 2013
    Co-Authors: Yushu Zhang, Di Xiao
    Abstract:

    S-boxes have been widely used as a base of new encryption strategies. Recently, the utilization of S-box becomes popular in image ciphers as a main approach to performing substitution. Based on a general model of S-box-only image ciphers, this paper performs a cryptanalysis on the performance of these kinds of ciphers against chosen Plaintext Attack. The cryptanalytic findings have been concluded that not only S-box-only image ciphers are practically insecure against chosen Plaintext Attack, but also the computational complexity of the Attack is only O(128L), where L is the total number of pixels with respect to the image. Moreover, a real S-box-only chaotic image cipher is tested as an example analysis to demonstrate our assertion. Finally, we give four corresponding improvement ideas that help to design a secure cryptosystem based on S-boxes.

  • analysis and improvement of a hash based image encryption algorithm
    Communications in Nonlinear Science and Numerical Simulation, 2011
    Co-Authors: Shaojiang Deng, Yanping Zhan, Di Xiao
    Abstract:

    Abstract The security of digital image attracts much attention recently. A hash-based digital image encryption algorithm has been proposed in Ref. [1] . But both the theoretical analysis and computer simulation show the characteristic of diffusion is too weak to resist Chosen Plaintext Attack and Known Plaintext Attack. Besides, one bit difference of the plain pixel will lead to only one corresponding bit change of the cipher pixel. In our improved algorithm, coupled with self-adaptive algorithm, only one pixel difference of the plain-image will cause changes of almost all the pixels in the cipher-image (NPCR > 98.77%), and the unified average changing intensity is high (UACI > 30.96%). Both theoretical analysis and computer simulation indicate that the improved algorithm can overcome these flaws and maintain all the merits of the original one.

Jiantao Zhou - One of the best experts on this subject based on the ideXlab platform.

  • improved known Plaintext Attack to permutation only multimedia ciphers
    Information Sciences, 2018
    Co-Authors: Jiantao Zhou, Yushu Zhang, Leo Yu Zhang, Yuansheng Liu, Cong Wang, Guanrong Chen
    Abstract:

    Abstract Permutation is a commonly used operation in many secure multimedia systems . However, it is fragile against cryptanalysis when used alone. For instance, it is well-known that permutation-only multimedia encryption is insecure against known-Plaintext Attack (KPA). There exist algorithms that are able to (partially) retrieve the secret permutation sequences in polynomial time with logarithmic amount of Plaintexts in the number of elements to be permuted. But existing works fail to answer how many known Plaintexts are needed to fully recover a underlying secret permutation sequence and how to balance the storage cost and computational complexity in implementing the KPA Attack. This paper addresses these two problems. With a new concept of composite representation, the underlying theoretical rules governing the KPA Attack on a permutation-only cipher are revealed, and some attractive algorithms outperforming the state-of-the-art methods in terms of computational complexity are developed. As a case study, experiments are performed on permutation-only image encryption to verify the theoretic analysis . The performance gap of the proposed KPA between artificial noise-like images, which perfectly fits the theoretical model, and the corresponding natural images is identified and analyzed. Finally, experimental results are shown to demonstrate the efficiency improvement of the new schemes over the existing ones.

  • On the Security of Chaotic Convolutional Coder
    IEEE Transactions on Circuits and Systems I: Regular Papers, 2011
    Co-Authors: Jiantao Zhou
    Abstract:

    This paper evaluates the security of the generalized chaotic convolutional coder, which is a recently proposed joint error-correction and encryption scheme integrating the chaotic encryption into the convolutional coding. Our results show that the probability of fully recovering the pseudorandom sequence (PRS) controlling the chaotic switches is at least 0.289 under known-Plaintext Attack, if the number of available Plaintext/ciphertext pairs p is equal to the constraint length k of the chaotic convolutional coder. In the case that p=k+e , where e ∈ Z+, we prove that the probability to fully deduce the PRS is lower bounded by 1-2-e. Furthermore, we propose four types of chosen-Plaintext Attack with different decoding complexities and efficiencies to fully derive the PRS.

  • cryptanalysis of chaotic convolutional coder
    International Symposium on Circuits and Systems, 2010
    Co-Authors: Jiantao Zhou
    Abstract:

    In this paper, we evaluate the security of a recently proposed joint error correction and encryption approach called chaotic convolutional coder, which integrates the chaotic encryption into the convolutional coding. We show that the probability of recovering the key vector controlling the chaotic switch is at least 0.289 under known-Plaintext Attack, if the number of available Plaintext/ciphertext pairs p is equal to the constraint length k of the chaotic convolutional coder. In the case that p = k + e, where e > 0, we prove that the probability to recover the key vector is lower bounded by 1–2−e. We also consider the security of the chaotic con-volutional coder under chosen-Plaintext Attack. We propose two approaches to efficiently derive the key vector without leaving tractable pattern to the register. In particular, one of these two methods based on an efficient erasure code is capable of recovering the key vector with complexity of order O(k log k).

  • on the security of multimedia encryption schemes based on multiple huffman table mht
    International Conference on Multimedia and Expo, 2006
    Co-Authors: Jiantao Zhou, Zhiqin Liang, Yan Chen
    Abstract:

    This paper addresses the security issues of the multimedia encryption schemes based on multiple Huffman table (MHT). A detailed analysis of known-Plaintext Attack is presented to show that the Huffman tables used for encryption should be carefully selected to avoid the weak keys problem. Further, we propose an efficient chosen-Plaintext Attack on the basic MHT method as well as the enhanced scheme inserting random bits. We also show that random rotation in partitioned bit stream cannot essentially improve the security.

Yushu Zhang - One of the best experts on this subject based on the ideXlab platform.

  • improved known Plaintext Attack to permutation only multimedia ciphers
    Information Sciences, 2018
    Co-Authors: Jiantao Zhou, Yushu Zhang, Leo Yu Zhang, Yuansheng Liu, Cong Wang, Guanrong Chen
    Abstract:

    Abstract Permutation is a commonly used operation in many secure multimedia systems . However, it is fragile against cryptanalysis when used alone. For instance, it is well-known that permutation-only multimedia encryption is insecure against known-Plaintext Attack (KPA). There exist algorithms that are able to (partially) retrieve the secret permutation sequences in polynomial time with logarithmic amount of Plaintexts in the number of elements to be permuted. But existing works fail to answer how many known Plaintexts are needed to fully recover a underlying secret permutation sequence and how to balance the storage cost and computational complexity in implementing the KPA Attack. This paper addresses these two problems. With a new concept of composite representation, the underlying theoretical rules governing the KPA Attack on a permutation-only cipher are revealed, and some attractive algorithms outperforming the state-of-the-art methods in terms of computational complexity are developed. As a case study, experiments are performed on permutation-only image encryption to verify the theoretic analysis . The performance gap of the proposed KPA between artificial noise-like images, which perfectly fits the theoretical model, and the corresponding natural images is identified and analyzed. Finally, experimental results are shown to demonstrate the efficiency improvement of the new schemes over the existing ones.

  • chosen Plaintext Attack of an image encryption scheme based on modified permutation diffusion structure
    Nonlinear Dynamics, 2016
    Co-Authors: Yuansheng Liu, Leo Yu Zhang, Yushu Zhang, Jia Wang, Kwokwo Wong
    Abstract:

    Since the first appearance in Fridrich’s design, the usage of permutation–diffusion structure for designing digital image cryptosystem has been receiving increasing research attention in the field of chaos-based cryptography. Recently, a novel chaotic image cipher using a single-round modified permutation–diffusion pattern (ICMPD) was proposed. Unlike traditional permutation–diffusion structure, the permutation of ICMPD is operated on bit level instead of pixel level and its diffusion stage is operated on masked pixels, which are obtained by carrying out the classical affine cipher, instead of plain pixels. Following a divide-and-conquer strategy, this paper reports that ICMPD can be compromised by a chosen-Plaintext Attack efficiently and the involved data complexity is linear to the size of the plain-image. Moreover, the relationship between the cryptographic kernel at the diffusion stage of ICMPD and the classical modulo addition then XORing operation is explored thoroughly.

  • chosen Plaintext Attack of an image encryption scheme based on modified permutation diffusion structure
    arXiv: Cryptography and Security, 2015
    Co-Authors: Yuansheng Liu, Leo Yu Zhang, Yushu Zhang, Jia Wang, Kwokwo Wong
    Abstract:

    Since the first appearance in Fridrich's design, the usage of permutation-diffusion structure for designing digital image cryptosystem has been receiving increasing research attention in the field of chaos-based cryptography. Recently, a novel chaotic Image Cipher using one round Modified Permutation-Diffusion pattern (ICMPD) was proposed. Unlike traditional permutation-diffusion structure, the permutation is operated on bit level instead of pixel level and the diffusion is operated on masked pixels, which are obtained by carrying out the classical affine cipher, instead of plain pixels in ICMPD. Following a \textit{divide-and-conquer strategy}, this paper reports that ICMPD can be compromised by a chosen-Plaintext Attack efficiently and the involved data complexity is linear to the size of the plain-image. Moreover, the relationship between the cryptographic kernel at the diffusion stage of ICMPD and modulo addition then XORing is explored thoroughly.

  • cryptanalyzing a novel image cipher based on mixed transformed logistic maps
    Multimedia Tools and Applications, 2014
    Co-Authors: Yushu Zhang, Di Xiao, Wenying Wen
    Abstract:

    Recently, a novel image cipher [Multimed Tools Appl (2012) 56:315---330] was proposed based on mixed transformed logistic maps. The cipher includes three parts: initial permutation of all the pixels with six odd keys, nonlinear diffusion using the first chaotic keystream and xoring the second chaotic keystream with the resultant values, and Zig-Zag diffusion with the third chaotic keystream. It was claimed that the nonlinear diffusion using the first chaotic map, xoring with the second chaotic map and the Zig-Zag diffusion with the third chaotic map are done to improve the security against the known/chosen Plaintext Attack. However, the cipher is insecure against chosen Plaintext Attack. In this paper, we analyze the security weakness of the cipher. As for different images, three chaotic keys keep unchanged so that three chaotic keystreams are also fixed. Our target is to reveal six odd integer keys and three chaotic keystreams equivalent to three chaotic keys. By applying chosen Plaintext Attack, we can reveal them through two different methods. Experimental results also verify our assertion.

  • vulnerability to chosen Plaintext Attack of a general optical encryption model with the architecture of scrambling then double random phase encoding
    Optics Letters, 2013
    Co-Authors: Yushu Zhang, Di Xiao
    Abstract:

    We demonstrate a new approach to chosen-Plaintext Attack on a general encryption model based on scrambling preprocessing operation and double random phase encoding (DRPE). With this Attack, an opponent can access both the scrambling key and two random phase keys. We hope that our work motivates further security analysis of the optical encryption scheme combining the scrambling techniques and DRPE.

Xiang Peng - One of the best experts on this subject based on the ideXlab platform.

  • vulnerability to chosen Plaintext Attack of optoelectronic information encryption with phase shifting interferometry
    Optical Engineering, 2011
    Co-Authors: Wan Qin, Xiang Peng, Xiangfeng Meng, Bruce Z. Gao
    Abstract:

    The optical cryptosystem based on phase-shifting interferom- etry (PSI) is one of the most interesting optical cryptographic schemes in recent years. However, we find that the PSI technique provides an attrac- tive method to record the ciphertext, but contributes little to the security level of the cryptosystem. From the cryptanalysis point of view, in a cer- tain simplified case, an Attacker is only required to crack two equivalent decryption keys instead of the original random phase keys and geometric key. Moreover, a chosen-Plaintext Attack method is proposed, in which an impulse function is chosen as a known Plaintext. By using this Attack, the Attacker can effectively recover any Plaintext from the corresponding ciphertext. The validity of the Attack is verified by computer simulations. C

  • improved known Plaintext Attack on optical encryption based on double random phase encoding
    Symposium on Photonics and Optoelectronics, 2010
    Co-Authors: Wan Qin, Xiang Peng, Xiangfeng Meng
    Abstract:

    This paper analysis the security of the optical encryption scheme based on the classical double random phase encoding. We describe a known-Plaintext Attack which can be used to successfully access the encryption key with the preknowledge of only one arbiturary pair of known Plaintext-ciphertext. A phase retrieval algorithm is employed in this Attack. Computer simulations are made to demonstrate the effectiveness. The results show that even implementing only one round of iteration in the phase retrieval, an Attacker can obtain a clear decoded Plaintext (a gray-scale image) from an intercept ciphertext.

  • vulnerability to known Plaintext Attack of optical encryption schemes based on two fractional fourier transform order keys and double random phase keys
    Journal of Optics, 2009
    Co-Authors: Wan Qin, Xiang Peng
    Abstract:

    From the perspective of optical information security, we demonstrate that conventional phase retrieval algorithms, such as the Gerchberg–Saxton algorithm, can be still valid when extended from the Fourier transform domain into the fractional Fourier transform (FRFT) domain. Based on this extension, we propose a method of known-Plaintext Attack (KPA) on double random phase encoding in the fractional Fourier transform domain (DRPE-FRFT). With this Attack, an opponent can access two encryption phase keys with the help of the phase retrieval algorithm in the FRFT domain, and meanwhile obtain the two FRFT order keys by using an exhaustive search. This indicates that the optical encryption scheme based on the DRPE-FRFT scheme is vulnerable to KPA due to the nature of the linearity of FRFT. The validity of this Attack is verified by numerical simulations.

  • Known-Plaintext Attack on the double phase encoding and its implementation with parallel hardware
    Information Optics and Photonics Technologies II, 2007
    Co-Authors: Hengzheng Wei, Xiang Peng, Haitao Liu, Songlin Feng, Bruce Z. Gao
    Abstract:

    A known-Plaintext Attack on the double phase encryption scheme implemented with parallel hardware is presented. The double random phase encoding (DRPE) is one of the most representative optical cryptosystems developed in mid of 90's and derives quite a few variants since then. Although the DRPE encryption system has a strong power resisting to a brute-force Attack, the inherent architecture of DRPE leaves a hidden trouble due to its linearity nature. Recently the real security strength of this opto-cryptosystem has been doubted and analyzed from the cryptanalysis point of view. In this presentation, we demonstrate that the optical cryptosystems based on DRPE architecture are vulnerable to known-plain text Attack. With this Attack the two encryption keys in the DRPE can be accessed with the help of the phase retrieval technique. In our approach, we adopt hybrid input-output algorithm (HIO) to recover the random phase key in the object domain and then infer the key in frequency domain. Only a Plaintext-ciphertext pair is sufficient to create vulnerability. Moreover this Attack does not need to select particular Plaintext. The phase retrieval technique based on HIO is an iterative process performing Fourier transforms, so it fits very much into the hardware implementation of the digital signal processor (DSP). We make use of the high performance DSP to accomplish the known-Plaintext Attack. Compared with the software implementation, the speed of the hardware implementation is much fast. The performance of this DSP-based cryptanalysis system is also evaluated.

  • chosen Plaintext Attack on lensless double random phase encoding in the fresnel domain
    Optics Letters, 2006
    Co-Authors: Xiang Peng, Hengzheng Wei, Peng Zhang
    Abstract:

    We demonstrate a method of chosen-Plaintext Attack on lensless double-random phase encoding (L-DRPE) in the Fresnel domain. With this Attack an opponent can access two encryption keys with help of the impulse functions as chosen Plaintexts. This shows that a lensless optical encryption scheme based on DRPE is vulnerable to chosen-Plaintext Attack. Cryptoanalysis also indicates that the security worry originates from the linearity of the encryption and decryption mechanism of the L-DRPE scheme. One of the interesting features of the proposed Attack is that the decryption process is lossless. Numerical simulations show good agreement with theoretical analysis.

Hengzheng Wei - One of the best experts on this subject based on the ideXlab platform.

  • Known-Plaintext Attack on the double phase encoding and its implementation with parallel hardware
    Information Optics and Photonics Technologies II, 2007
    Co-Authors: Hengzheng Wei, Xiang Peng, Haitao Liu, Songlin Feng, Bruce Z. Gao
    Abstract:

    A known-Plaintext Attack on the double phase encryption scheme implemented with parallel hardware is presented. The double random phase encoding (DRPE) is one of the most representative optical cryptosystems developed in mid of 90's and derives quite a few variants since then. Although the DRPE encryption system has a strong power resisting to a brute-force Attack, the inherent architecture of DRPE leaves a hidden trouble due to its linearity nature. Recently the real security strength of this opto-cryptosystem has been doubted and analyzed from the cryptanalysis point of view. In this presentation, we demonstrate that the optical cryptosystems based on DRPE architecture are vulnerable to known-plain text Attack. With this Attack the two encryption keys in the DRPE can be accessed with the help of the phase retrieval technique. In our approach, we adopt hybrid input-output algorithm (HIO) to recover the random phase key in the object domain and then infer the key in frequency domain. Only a Plaintext-ciphertext pair is sufficient to create vulnerability. Moreover this Attack does not need to select particular Plaintext. The phase retrieval technique based on HIO is an iterative process performing Fourier transforms, so it fits very much into the hardware implementation of the digital signal processor (DSP). We make use of the high performance DSP to accomplish the known-Plaintext Attack. Compared with the software implementation, the speed of the hardware implementation is much fast. The performance of this DSP-based cryptanalysis system is also evaluated.

  • chosen Plaintext Attack on lensless double random phase encoding in the fresnel domain
    Optics Letters, 2006
    Co-Authors: Xiang Peng, Hengzheng Wei, Peng Zhang
    Abstract:

    We demonstrate a method of chosen-Plaintext Attack on lensless double-random phase encoding (L-DRPE) in the Fresnel domain. With this Attack an opponent can access two encryption keys with help of the impulse functions as chosen Plaintexts. This shows that a lensless optical encryption scheme based on DRPE is vulnerable to chosen-Plaintext Attack. Cryptoanalysis also indicates that the security worry originates from the linearity of the encryption and decryption mechanism of the L-DRPE scheme. One of the interesting features of the proposed Attack is that the decryption process is lossless. Numerical simulations show good agreement with theoretical analysis.

  • known Plaintext Attack on optical encryption based on double random phase keys
    Optics Letters, 2006
    Co-Authors: Xiang Peng, Peng Zhang, Hengzheng Wei
    Abstract:

    We demonstrate a new approach to known-Plaintext Attack on an optical encryption scheme based on double random phase keys. With this Attack an opponent can access both random phase keys with the help of the phase retrieval technique. This demonstration shows that an optical encryption scheme based on double random encoding is vulnerable to known-Plaintext Attack.