An image scrambling algorithm using discrete Henon map

Ping, Ping; Mao, Yingchi; Lv, Xin; Xu, Feng; Xu, Guoyan

doi:10.1109/icinfa.2015.7279326

Cited by 15 publications

(19 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Hénon map is a 2D discrete-time dynamic system which was introduced by Michel Hénon. The Hénon map equations [12] are defined by Eq. (4).…”

Section: Hénon Mapmentioning

confidence: 99%

“…In this model, the time is discrete but the state variables , are continuous. The equations [12] of the discrete Hénon map to scramble digital images are defined as Eq. (5).…”

Section: Hénon Mapmentioning

confidence: 99%

“…However, the classic Arnold transformation has several limitations: (1) it can only be applied to square images; (2) it requires multi-iterations to achieve the scrambling effect to a certain degree; (3) the time cost of decryption is expensive because it uses the periodicity of the transformation. Researchers have proposed many improved models to solve these problems [10][11][12][13]. To apply the Arnold map to non-square images, Zhao [10] proposed a non-square image scrambling algorithm based on the Arnold map and a simple one-dimensional (1D) Logistic map.…”

Section: Introductionmentioning

confidence: 99%

“…Hua [11] proposed a two-dimensional Sine Logistic modulation map (2D-SLMM) to enlarge key space, improve the scrambling efficiency and obtain better chaotic effect. Ping [12] proposed a square image scrambling algorithm using the discrete two-dimensional (2D) Hénon map, the algorithm can improve the scrambling efficiency, achieve high quality scrambling effect in several iterations and decipher the scrambling using inverse transformation. The experimental results in [12] demonstrate better characteristics than using an Arnold map.…”

Section: Introductionmentioning

confidence: 99%

“…Ping [12] proposed a square image scrambling algorithm using the discrete two-dimensional (2D) Hénon map, the algorithm can improve the scrambling efficiency, achieve high quality scrambling effect in several iterations and decipher the scrambling using inverse transformation. The experimental results in [12] demonstrate better characteristics than using an Arnold map. Kong [13] proposed a new inverse transform algorithm by solving equations based on Arnold map.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Non-square colour image scrambling based on two-dimensional Sine-Logistic and Hénon map

2017

KSII TIIS

View full text Add to dashboard Cite

Image scrambling is an important technology in information hiding, where the Arnold transformation is widely used. Several researchers have proposed the application of Hénon map in square image scrambling, and certain improved technologies require scrambling many times to achieve a good effect without resisting chosen-plaintext attack although it can be directly applied to non-square images. This paper presents a non-square image scrambling algorithm, which can resist chosen-plaintext attack based on a chaotic two-dimensional Sine Logistic modulation map and Hénon map (2D-SLHM). Theoretical analysis and experimental results show that the proposed algorithm has advantages in terms of key space, efficiency, scrambling degree, ability of anti-attack and robustness to noise interference.

show abstract

“…The Hénon map is a 2D discrete-time dynamic system which was introduced by Michel Hénon. The Hénon map equations [12] are defined by Eq. (4).…”

Section: Hénon Mapmentioning

confidence: 99%

“…In this model, the time is discrete but the state variables , are continuous. The equations [12] of the discrete Hénon map to scramble digital images are defined as Eq. (5).…”

Section: Hénon Mapmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%