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

27Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Li, C., Liu, Y., Zhang, L. Y., & Wong, K. W. (2014). Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem. Signal Processing: Image Communication, 29(8), 914–920. https://doi.org/10.1016/j.image.2014.06.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free