Breaking a chaotic image encryption algorithm based on perceptron model

TL;DR

This paper critically analyzes a chaotic image encryption algorithm based on the perceptron model, revealing that its security is compromised as the secret key can be reconstructed with minimal known-plaintext data, supported by proofs and experiments.

Contribution

The paper exposes security vulnerabilities in a perceptron-based chaotic image encryption algorithm, including the ease of key recovery with limited known plaintext.

Findings

Equivalent secret key can be reconstructed with one known-plaintext/ciphertext pair

Mathematical proof supports the security flaw

Experimental results confirm the vulnerability

Abstract

Recently, a chaotic image encryption algorithm based on perceptron model was proposed. The present paper analyzes 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, some other security defects are also reported.