期刊：
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION,2013年17(5):721-736 ISSN：1089-778X
通讯作者：
Yang, SX
作者机构：
[Li, Miqing; Liu, Xiaohui] Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, United Kingdom;[Zheng, Jinhua] College of Information Engineering, Xiangtan University, Xiangtan 411105, China;[Yang, Shengxiang] School of Computer Science and Informatics, De Montfort University, Leicester LE1 9BH, United Kingdom
期刊：
Signal Processing,2011年91(4):949-954 ISSN：0165-1684
通讯作者：
Li, CQ
作者机构：
[Li, Chengqing] College of Information Engineering, Xiangtan University, Xiangtan 411105, Hunan, China;[Li, Chengqing; Lo, Kwok-Tung] Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong, Hong Kong
摘要：
Recently, an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size M x (8N), this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only O(32 . MN) and O(16 . n(0) . MN) respectively, where no is the number of known/chosen-plaintexts used. The method can be easily extended to break any permutation-only encryption scheme exerting on plaintext of size M x N and with L different levels of values. The corresponding spatial complexity and computational complexity are only O(MN) and O(inverted right perpendicularlog(L)(MN)inverted left perpendicular . MN) respectively. In addition, some specific remarks on the performance of the image scrambling encryption algorithm are presented. (C) 2010 Elsevier B.V. All rights reserved.
作者机构：
[Liu, Yuansheng; Xie, Tao; Li, Chengqing] MOE Key Laboratory of Intelligent Computing and Information Processing, College of Information Engineering, Xiangtan University, Xiangtan 411105 Hunan, China;[Chen, Michael Z. Q.] Department of Mechanical Engineering, University of Hong Kong, Hong Kong, Hong Kong
摘要：
Recently, a novel image encryption scheme based on improved hyperchaotic sequences was proposed. A pseudo-random number sequence, generated by a hyper-chaos system, is used to determine two involved encryption functions, bitwise exclusive or (XOR) operation and modulo addition. It was reported that the scheme can be broken with some pairs of chosen plain-images and the corresponding cipher-images. This paper re-evaluates the security of the encryption scheme and finds that the encryption scheme can be broken with only one known plain-image. The performance of the known-plaintext attack, in terms of success probability and computation load, become even much better when two known plain-images are available. In addition, security defects on insensitivity of the encryption result with respect to changes of secret key and plain-image are also reported.
作者：
Wang, Qianxue;Yu, Simin;Li, Chengqing;Lu, Jinhu;Fang, Xiaole;Guyeux, Christophe;Bahi, Jacques M.
期刊：
IEEE Transactions on Circuits and Systems I: Regular Papers,2016年63(3):401-412 ISSN：1549-8328
通讯作者：
Yu, SM;Li, CQ;Lu, JH
作者机构：
[Wang, Qianxue; Yu, Simin] College of Automation, Guangdong University of Technology, Guangzhou, China;[Guyeux, Christophe; Bahi, Jacques M.] Femto-st Institute, UMR 6174, University of Franche-Comté,, Besancon, France;[Lu, Jinhu] Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China;[Li, Chengqing] College of Information Engineering, Xiangtan University, Xiangtan, China;[Fang, Xiaole] Land and Resources Technology Center of Guangdong Province, Guangzhou, China
通讯机构：
[Li, Chengqing] Xiangtan Univ, Coll Informat Engn, Xiangtan 411105, Peoples R China.;[Yu, Simin] Guangdong Univ Technol, Coll Automat, Guangzhou 510006, Guangdong, Peoples R China.;[Lu, Jinhu] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China.
期刊：
IET CONTROL THEORY AND APPLICATIONS,2012年6(2):229-234 ISSN：1751-8644
通讯作者：
Lan, YH
作者机构：
[Zhou, Y.] School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, China;[Lan, Y. -H.; Huang, H. -X.] School of Information Engineering, Xiangtan University, Xiangtan, Hunan 411105, China
通讯机构：
[Lan, Y. -H.] Xiangtan Univ, Sch Informat Engn, Xiangtan 411105, Hunan, Peoples R China.
关键词：
Existence conditions - Linear matrix inequality approach - LMI techniques - LMI toolboxes - matrix - Numerical example - Observer based control - Observer-based controllers - Robust asymptotic stability - Sufficient conditions - Uncertain linear system
摘要：
In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size M x N with T possible value levels into K blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only O(inverted right perpendicularlog(T)(M center dot N/K)inverted left perpendicular) known/chosen plain-images are sufficient to achieve a good performance, and the computational complexity is O(M center dot N center dot inverted right perpendicularlog(T)(M center dot N/K)inverted left perpendicular), which effectively demonstrates that hierarchical permutation-only image encryption algorithms are less secure than normal (i.e., non-hierarchical) ones. Detailed experiment results are given to verify the feasibility of the known-plaintext attack. In addition, it is pointed out that the security of HCIE against ciphertext-only attack was much overestimated. (C) 2015 Elsevier B.V. All rights reserved.
作者机构：
[Wong, Kwok-Wo] Department of Electronic Engineering, City University of Hong Kong, Hong Kong, Hong Kong;[Ou, Rong; Li, Chengqing] College of Information Engineering, Xiangtan University, Xiangtan 411105 Hunan, China;[Zhang, Leo Yu; Shu, Shi] School of Mathematics and Computational Science, Xiangtan University, Xiangtan, 411105 Hunan, China;[Zhang, Leo Yu] State Grid Electric Power Research Institute, Qinghe, Beijing 100192, China
期刊：
Physical Review A - Atomic, Molecular, and Optical Physics,2010年82(2) ISSN：1050-2947
通讯作者：
Li, Q
作者机构：
[Li, Qin] College of Information Engineering, Xiangtan University, Xiangtan 411105, China;[Chan, W. H.; Li, Qin] Department of Mathematics, Hong Kong Baptist University, Kowloon, Hong Kong;[Long, Dong-Yang; Li, Qin] Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China
摘要：
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.
摘要：
The paper deals with the forced oscillation of the fractional differential equation with the initial conditions ( D a q − k x ) ( a ) = b k Open image in new window ( k = 1 , 2 , … , m − 1 Open image in new window ) and lim t → a + ( I a m − q x ) ( t ) = b m Open image in new window , where D a q x Open image in new window is the Riemann-Liouville fractional derivative of order q of x, m − 1 < q ≤ m Open image in new window , m ≥ 1 Open image in new window is an integer, I a m − q x Open image in new window is the Riemann-Liouville fractional integral of order m − q Open image in new window of x, and b k Open image in new window ( k = 1 , 2 , … , m Open image in new window ) are/is constants/constant. We obtain some oscillation theorems for the equation by reducing the fractional differential equation to the equivalent Volterra fractional integral equation and by applying Young’s inequality. We also establish some new oscillation criteria for the equation when the Riemann-Liouville fractional operator is replaced by the Caputo fractional operator. The results obtained here improve and extend some existing results. An example is given to illustrate our theoretical results. MSC:34A08, 34C10.
摘要：
In this paper, the Crank-Nicolson (CN) difference scheme for the coupled nonlinear Schrodinger equations with the Riesz space fractional derivative is studied. The existence of this difference solution is proved by the Brouwer fixed point theorem. The stability and convergence of the CN scheme are discussed in the L-2 norm. When the fractional order is two, all those results are in accord with the difference scheme developed for the classical non-fractional coupled nonlinear Schrodinger equations. Some numerical examples are also presented. (C) 2013 Elsevier Inc. All rights reserved.
作者机构：
[Qin Li; Chengqing Li] College of Information Engineering, Xiangtan University, Xiangtan 411105, Hunan, China;[Yu Zhang; Shi Shu] School of Mathematics and Computational Science, Xiangtan University, Xiangtan 411105, Hunan, China;[Dan Zhang] College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, Zhejiang, China
摘要：
Recently, a chaotic image encryption algorithm based on the perceptron model was proposed. The present paper analyzes the security of the algorithm and finds that the equivalent secret key can be reconstructed with only one pair of known-plaintext/ciphertext, which is supported by both mathematical proof and experiment results. In addition, two other security defects are also reported.
作者：
Zhang, Leo Yu;Hu, Xiaobo;Liu, Yuansheng;Wong, Kwok-Wo;Gan, Jie
期刊：
Communications in Nonlinear Science and Numerical Simulation,2014年19(10):3653-3659 ISSN：1007-5704
通讯作者：
Zhang, L.Y.(leoxtu@gmail.com)
作者机构：
[Gan, Jie; Hu, Xiaobo] State Grid Electric Power Research Institute, Beijing 100192, China;[Zhang, Leo Yu; Wong, Kwok-Wo] Department of Electronic Engineering, City University of Hong Kong, Hong Kong;[Liu, Yuansheng] College of Information Engineering, Xiangtan University, Xiangtan 411105, Hunan, China
通讯机构：
[Zhang, Leo Yu] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
摘要：
Many round-based chaotic image encryption algorithms employ the permutation-diffusion structure. This structure has been found insecure when the iteration round is equal to one and the secret permutation of some existing schemes can be recovered even a higher round is adopted. In this paper, we present a single round permutation-diffusion chaotic cipher for gray image, in which some temp-value feedback mechanisms are introduced to resist the known attacks. Specifically, we firstly embed the plaintext feedback technique in the permutation process to develop different permutation sequences for different plain-images and then employ plaintext/ciphertext feedback for diffusion to generate equivalent secret key dynamically. Experimental results show that the new scheme owns large key space and can resist the differential attack. It is also efficient. (C) 2014 Elsevier B.V. All rights reserved.
期刊：
Computers and Mathematics with Applications,2011年62(3):1460-1471 ISSN：0898-1221
通讯作者：
Zhou, Y.(yzhou@xtu.edu.cn)
作者机构：
[Yong Zhou] School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, China;[Yong-Hong Lan] School of Information Engineering, Xiangtan University, Xiangtan, Hunan 411105, China
通讯机构：
[Zhou, Yong] Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Hunan, Peoples R China.
摘要：
Recently, a RGB image encryption algorithm based on DNA encoding and chaos map has been proposed. It was reported that the encryption algorithm can be broken with four pairs of chosen plain-images and the corresponding cipher-images. This paper re-evaluates the security of the encryption algorithm, and finds that the encryption algorithm can be broken efficiently with only one known plain-image. The effectiveness of the proposed known-plaintext attack is supported by both rigorous theoretical analysis and experimental results. In addition, two other security defects are also reported. (C) 2014 Elsevier Ltd. All rights reserved.
作者：
Chen, Zhuangbin;Liu, Anfeng;Li, Zhetao;Choi, Young-June;Sekiya, Hiroo;Li, Jie
期刊：
MOBILE INFORMATION SYSTEMS,2017年2017 ISSN：1574-017X
通讯作者：
Li, Zhetao(liztchina@gmail.com)
作者机构：
[Chen, Zhuangbin; Liu, Anfeng] School of Information Science and Engineering, Central South University, Changsha, 410083, China;[Sekiya, Hiroo] Graduate School of Advanced Integration Science, Chiba University, Chiba, 263-8522, Japan;[Li, Jie] Faculty of Engineering, Information and Systems, University of Tsukuba, Tsukuba, 305-8573, Japan;[Choi, Young-June] Department of Software, Ajou University, Suwon, 443749, Korea, Republic of;[Li, Zhetao] College of Information Engineering, Xiangtan University, Xiangtan, 411105, China
作者：
Zhiwei Sun;Cai Zhang;Banghai Wang;Qin Li;Dongyang Long
期刊：
Quantum Information Processing,2013年12(11):3411-3420 ISSN：1570-0755
通讯作者：
Sun, Z.(sunzhiwei1986@gmail.com)
作者机构：
[Banghai Wang] Faculty of Computer, Guangdong University of Technology, Guangzhou 510006, China;[Dongyang Long; Zhiwei Sun; Cai Zhang] School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China;[Qin Li] College of Information Engineering, Xiangtan University, Xiangtan 411105, China
通讯机构：
[Sun, Zhiwei] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China.
关键词：
Exposed to - Non-trivial - Protocol cans - Quantum Information - Quantum key - Session key - Single particle - Unitary operation
期刊：
International Journal of Bifurcation and Chaos,2010年20(8):2561-2568 ISSN：0218-1274
通讯作者：
Li, C.(chengqing8@gmail.com)
作者机构：
[Li, Chengqing] College of Information Engineering, Xiangtan University, Xiangtan 411105, China;[Arroyo, David] Instituto de Fí,sica Aplicada, Consejo Superior de Investigaciones Cientí,ficas, Serrano 144, 28006 Madrid, Spain;[Li, Chengqing; Lo, Kwok-Tung] Department of Electronic and Information Engineering, Hong Kong Polytechnic University, Hong Kong, Hong Kong
摘要：
In this paper, a linearly implicit conservative difference scheme for the coupled nonlinear Schrodinger equations with space fractional derivative is proposed. This scheme conserves the mass and energy in the discrete level and only needs to solve a linear system at each step. The existence and uniqueness of the difference solution are proved. The stability and convergence of the scheme are discussed, and it is shown to be convergent of order O (tau(2) + h(2)) in the discrete t(2) norm with the time step tau and mesh size h. When the fractional order is two, all those results are in accord with the difference scheme proposed for the classical non-fractional coupled nonlinear Schrodinger equations. Some numerical examples are also reported. (C) 2014 Elsevier Inc. All rights reserved.