Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

34 Scopus Citations
View graph of relations

Author(s)

  • Chengqing Li
  • Yuansheng Liu
  • Leo Yu Zhang
  • Kwok-Wo Wong

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)914-920
Journal / PublicationSignal Processing: Image Communication
Volume29
Issue number8
Online published1 Jul 2014
Publication statusPublished - Sep 2014

Abstract

As a fundamental theorem in number theory, the Chinese Reminder Theorem (CRT) is widely used to construct cryptographic primitives. This paper investigates the security of a class of image encryption schemes based on CRT, referred to as CECRT. Making use of some properties of CRT, the equivalent secret key of CECRT can be recovered efficiently. The required number of pairs of chosen plaintext and the corresponding ciphertext is only (1+⌈ ( log2L)/l⌉), the attack complexity is only O(L), where L is the plaintext length and l is the number of bits representing a plaintext symbol. In addition, other defects of CECRT, such as invalid compression function and low sensitivity to plaintext, are reported. The work in this paper will help clarify positive role of CRT in cryptology. © 2014 Elsevier B.V.

Research Area(s)

  • Chinese Remainder Theorem (CRT), Chosen-plaintext attack, Compression, Cryptanalysis, Encryption

Citation Format(s)

Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem. / Li, Chengqing; Liu, Yuansheng; Zhang, Leo Yu; Wong, Kwok-Wo.

In: Signal Processing: Image Communication, Vol. 29, No. 8, 09.2014, p. 914-920.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review