CRYPTANALYSIS OF A SYMMETRIC COLOR IMAGE ENCRYPTION WITH ONE-ROUND ENCRYPTION
نویسندگان
چکیده
منابع مشابه
Cryptanalysis of GSM encryption algorithm A5/1
The A5/1 algorithm is one of the most famous stream cipher algorithms used for over-the-air communication privacy in GSM. The purpose of this paper is to analyze several weaknesses of A5/1, including an improvement to an attack and investigation of the A5/1 state transition. Biham and Dunkelman proposed an attack on A5/1 with a time and data complexity of 239.91and 221.1, ...
متن کاملAlgebraic Cryptanalysis of Deterministic Symmetric Encryption
Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and algebraic cryptanalysis. Statistical cryptanalysis is a powerful tool for evaluating the security but it often requires a large number of pla...
متن کاملCryptanalysis of a Chaotic Image Encryption Method
The security of digital images attracts much attention recently, and many image encryption methods have been proposed. In ISCAS2000, a new chaotic key-based algorithm (CKBA) for image encryption was proposed. This paper points out CKBA is very weak to the chosen/known-plaintext attack with only one plainimage, and its security to brute-force ciphertext-only attack is overestimated by the author...
متن کاملCryptanalysis of Fridrich's Chaotic Image Encryption
We cryptanalyze Fridrich’s chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret permutation that is used to shuffle the pixels of a round input. We demonstrate the effectiveness of our attack with examples and simulation results. We also show that our proposed...
متن کاملCryptanalysis of an image encryption scheme
We present cryptanalysis of an image encryption scheme, which is based on the base-switching (BS) lossless compression algorithm. The following conclusions are reached: 1. the size of the key space, i.e., the security against brute-force attacks, was greatly overestimated by the designers; and 2. the scheme is not secure against known/chosen-plaintext/ciphertext attacks. A real example is given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ASEAN Engineering Journal
سال: 2015
ISSN: 2586-9159
DOI: 10.11113/aej.v7.15486