Results from MathSciNet: Mathematical Reviews on the Web
c Copyright American Mathematical Society 2016
MR3083841 94A60 37D45
Li, Chengqing (PRC-XIA-INC) ; Liu, Yuansheng (PRC-XIA-INC) ;
Xie, Tao (PRC-XIA-INC) ; Chen, Michael Z. Q. (PRC-HK-ME)
Breaking a novel image encryption scheme based on improved hyperchaotic
sequences. (English. English summary)
Nonlinear Dynam. 73 (2013), no. 3, 2083–2089.
MR3065496 (Review) 81P94 94A60
Li, Qin [Li, Qin 5] (PRC-XIA-CIE) ; Li, Chengqing (PRC-XIA-CIE) ;
Long, Dongyang (PRC-ZHO-C) ; Chan, Wai Hong ; Wang, Changji (PRC-ZHO-C)
Efficient arbitrated quantum signature and its proof of security. (English.
English summary)
Quantum Inf. Process. 12 (2013), no. 7, 2427–2439.
Summary: “In this paper, an efficient arbitrated quantum signature scheme is proposed
by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term
secret key with the arbitrator by utilizing the key together with a random number.
While in previous quantum signature schemes, the key shared between the signatory
and the arbitrator or between the receiver and the arbitrator could be used only once,
and thus each time when a signatory needs to sign, the signatory and the receiver have
to obtain a new key shared with the arbitrator through a quantum key distribution
protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and
provably secure.”
MR3063372 (Review) 94A60
Li, Chengqing (PRC-XIA-INC) ; Liu, Yuansheng (PRC-XIA-INC) ;
Zhang, Leo Yu (PRC-XIA-SMC) ; Chen, Michael Z. Q. (PRC-HK-ME)
Breaking a chaotic image encryption algorithm based on modulo addition and
XOR operation. (English. English summary)
Internat. J. Bifur. Chaos Appl. Sci. Engrg. 23 (2013), no. 4, 1350075, 12 pp.
Summary: “This paper re-evaluates the security of a chaotic image encryption algorithm
called MCKBA/HCKBA and finds that it can be broken efficiently with two known
plain-images and the corresponding cipher-images. In addition, it is reported that
a previously proposed breaking on MCKBA/HCKBA can be further improved by
reducing the number of chosen plain-images from four to two. The two attacks are
both based on the properties of solving a composite function involving the carry bit,
which is composed of the modulo addition and the bitwise OR operations. Both rigorous
theoretical analysis and detailed experimental results are provided.”
MR3001584 (Review) 81P94
Li, Qin [Li, Qin 5] (PRC-XIA-CIE) ; Li, Chengqing (PRC-XIA-CIE) ;
Wen, Zhonghua (PRC-XIA-CIE) ; Zhao, Weizhong (PRC-XIA-CIE) ;
Chan, Wai Hong
On the security of arbitrated quantum signature schemes. (English. English
summary)
J. Phys. A 46 (2013), no. 1, 015307, 6 pp.
Summary: “Due to the potential capability of providing unconditional security, arbitrated quantum signature (AQS) schemes, whose implementation depends on the
participation of a trusted third party, received intense attention in the past decade. Recently, some typical AQS schemes were cryptanalyzed and improved. In this paper, we
analyze the security property of some AQS schemes and show that all the previous AQS
Results from MathSciNet: Mathematical Reviews on the Web
c Copyright American Mathematical Society 2016
schemes, no matter whether original or improved, are still insecure in the sense that the
messages and the corresponding signatures can be exchanged among different receivers,
allowing the receivers to deny having accepted the signature of an appointed message.
Some further improved methods on the AQS schemes are also discussed.”
MR2998170 (Review) 94A08
Li, Chengqing (PRC-XIA-CIE) ; Zhang, Leo Yu (PRC-XIA-SMC) ;
Ou, Rong (PRC-XIA-CIE) ; Wong, Kwok-Wo (PRC-CHK-ELE) ;
Shu, Shi (PRC-XIA-SMC)
Breaking a novel colour image encryption algorithm based on chaos. (English.
English summary)
Nonlinear Dynam. 70 (2012), no. 4, 2383–2388.
Summary: “Recently, a colour image encryption algorithm based on chaos was proposed
by cascading two position permutation operations and one substitution operation, which
are all determined by some pseudo-random number sequences generated by iterating the
logistic map. This paper evaluates the security level of this encryption algorithm and
finds that the position permutation-only part and the substitution part can be separately
broken with only d(log2 (3M N ))/8e and 2 chosen plain-images, respectively, where M N
is the size of the plain-image. The effectiveness of the proposed chosen-plaintext attack
is supported by concise theoretical analyses, and is verified by experimental results.”
MR2943369 94A08
Zhang, Yu (PRC-XIA-SMC) ; Li, Chengqing (PRC-XIA-CIE) ;
Li, Qin [Li, Qin 5] (PRC-XIA-CIE) ; Zhang, Dan [Zhang, Dan 1] (PRC-ZHJ-CST) ;
Shu, Shi (PRC-XIA-SMC)
Breaking a chaotic image encryption algorithm based on perceptron model.
(English. English summary)
Nonlinear Dynam. 69 (2012), no. 3, 1091–1096.
MR2897601 (Review) 81P94
Li, Qin [Li, Qin 5] (PRC-XIA-CIE) ; Li, Chengqing (PRC-XIA-CIE) ;
Long, Dongyang (PRC-ZHO-C) ; Chan, W. H. ; Wu, Chunhui (PRC-GDUF-CT)
On the impossibility of non-static quantum bit commitment between two
parties. (English. English summary)
Quantum Inf. Process. 11 (2012), no. 2, 519–527.
Summary: “Recently, Choi et al. proposed an assumption on Mayers-Lo-Chau (MLC)
no-go theorem that the state of the entire quantum system is invariable to both participants before the unveiling phase. This makes us suspect that the theorem is only
applicable to static quantum bit commitment (QBC). This paper clarifies that the MLC
no-go theorem can be applied to not only static QBC, but also non-static one. A nonstatic QBC protocol proposed by Choi et al. is briefly reviewed and analyzed to work
as a supporting example. In addition, a novel way to prove the impossibility of the two
kinds of QBC is given.”
MR2725807 94A60 37N99
Li, Chengqing (PRC-HP-ELI) ; Li, Shujun [Li, Shu Jun 1] (D-KNST-CI) ;
Lo, Kwok-Tung (PRC-HP-ELI)
Breaking a modified substitution-diffusion image cipher based on chaotic
standard and logistic maps. (English. English summary)
Commun. Nonlinear Sci. Numer. Simul. 16 (2011), no. 2, 837–843.
Results from MathSciNet: Mathematical Reviews on the Web
c Copyright American Mathematical Society 2016
MR2738717 (2011j:94149) 94A60 37D45 37N99
Li, Chengqing (PRC-HP-ELI) ; Arroyo, David (E-CSIC-FA) ;
Lo, Kwok-Tung (PRC-HP-ELI)
Breaking a chaotic cryptographic scheme based on composition maps. (English.
English summary)
Internat. J. Bifur. Chaos Appl. Sci. Engrg. 20 (2010), no. 8, 2561–2568.
Summary: “Recently a chaotic cryptographic scheme based on composition maps was
proposed. This paper studies the security of the scheme and reports the following
problems: (1) the scheme can be broken by a differential attack with 6 + dlogL (M N )e
chosen plaintexts, where M N is the size of the plaintext and L is the number of different
elements in the plaintext; (2) the two composition maps both do not work as a secure
and efficient source of random numbers; (3) the scheme is not sensitive to changes in
the plaintext.”
MR2516672 Database Expansion Item
Li, Shujun [Li, Shu Jun 1] (D-HGN-IEN) ; Li, Chengqing (PRC-CHK-ELE) ;
Lo, Kwok-Tung (PRC-HP-ELI) ; Chen, Guanrong (PRC-CHK-ELE)
Cryptanalyzing an encryption scheme based on blind source separation.
(English. English summary)
IEEE Trans. Circuits Syst. I. Regul. Pap. 55 (2008), no. 4, 1055–1063.
MR2397075 (2009c:94049) 94A60 37N99
Li, Chengqing (PRC-CHK-ELE) ; Li, Shujun [Li, Shu Jun 1] (PRC-HP-ELI) ;
Alvarez, Gonzalo [Alvarez Maranon, G.] (E-CSIC-FA) ;
Chen, Guanrong (PRC-CHK-ELE) ; Lo, Kwok-Tung (PRC-HP-ELI)
Cryptanalysis of a chaotic block cipher with external key and its improved
version. (English. English summary)
Chaos Solitons Fractals 37 (2008), no. 1, 299–307.
Summary: “Recently, Pareek et al. proposed a symmetric key block cipher using multiple
one-dimensional chaotic maps. This paper reports some new findings on the security
problems of this kind of chaotic cipher: (1) a number of weak keys exist; (2) some
important intermediate data of the cipher are not sufficiently random; (3) the whole
secret key can be broken by a known-plaintext attack with only 120 consecutive known
plain-bytes in one known plaintext. In addition, it is pointed out that an improved
version of the chaotic cipher proposed by Wei et al. still suffers from all the same
security defects.”
MR2393593 (2009b:94042) 94A60
Arroyo, David (E-CSIC-FA) ;
Alvarez, Gonzalo [Alvarez Maranon, G.] (E-CSIC-FA) ;
Li, Shujun [Li, Shu Jun 1] (D-HGN-IEN) ; Li, Chengqing (PRC-CHK-ELE) ;
Nunez, Juana (E-CSIC-FA)
Cryptanalysis of a discrete-time synchronous chaotic encryption system.
(English. English summary)
Phys. Lett. A 372 (2008), no. 7, 1034–1039.
Summary: “Recently a chaotic cryptosystem based on discrete-time synchronization was
proposed. Some weaknesses of that new encryption system are addressed and exploited
in order to successfully cryptanalyze the system.”
Results from MathSciNet: Mathematical Reviews on the Web
c Copyright American Mathematical Society 2016
MR2168620 (2006h:94121) 94A60 94A12
Li, Chengqing (PRC-ZHJ) ; Li, Shujun [Li, Shu Jun 1] (PRC-CHK-ELE) ;
Chen, Guanrong (PRC-CHK-ELE) ; Chen, Gang [Chen, Gang 3] (PRC-ZHJ) ;
Hu, Lei [Hu, Lei 1] (PRC-ASBJ-SCG)
Cryptanalysis of a new signal security system for multimedia data transmission.
(English. English summary)
EURASIP J. Appl. Signal Process. 2005, no. 8, 1277–1288.
Summary: “Recently, a new signal security system called TDCEA (two-dimensional
circulation encryption algorithm) was proposed for real-time multimedia data transmission. This paper gives a comprehensive analysis of the security of TDCEA. The
following security problems are found: (1) there exist some essential security defects in
TDCEA; (2) two known-plaintext attacks can break TDCEA; (3) the chosen-plaintext
and chosen-ciphertext versions of the aforementioned two known-plaintext attacks can
break TDCEA with even smaller complexity and a better performance. Some experiments are given to show the security defects of TDCEA and the feasibility of the
proposed known-plaintext attacks. As a conclusion, TDCEA is not suitable for applications that require a high level of security.”