2015 International Conference on Communications and Signal Processing (ICCSP) 2015
DOI: 10.1109/iccsp.2015.7322662
|View full text |Cite
|
Sign up to set email alerts
|

Image encryption and decryption using combined key sequence of Logistic map and Lozi map

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…Another algorithm explained by Rohith and Sujatha (2015) is almost similar to one which is explained earlier. In this work a single key sequence Ki is generated from two key sequences of (1) Logistic map K 1i and (2) Lozi map K 2i .…”
Section: Related Workmentioning
confidence: 84%
“…Another algorithm explained by Rohith and Sujatha (2015) is almost similar to one which is explained earlier. In this work a single key sequence Ki is generated from two key sequences of (1) Logistic map K 1i and (2) Lozi map K 2i .…”
Section: Related Workmentioning
confidence: 84%
“…Chaotic maps are one example of the Stream cipher. Last two decades, manyresearchers suggested the idea of using the chaos-based cryptosystem for image encryption application [2]- [9]. The reason is, the chaotic map has the property of periodicity, sensitivity to initial conditions and parameters, high encryption rate, and simple in implementation, etc [2]- [10].…”
Section: Introductionmentioning
confidence: 99%
“…The chaotic key sequences play an important role to confuse the original to encrypted relationship imagesusing varying the position of the pixel and pixel values [4]. For encryption of the images, a wide variety of 1-Dimensional (1D), 2-Dimensional(2D) chaotic maps are available [2] [4] [5] [8] [9]. Out of these schemes, many researchers have proven using a combination of the chaotic maps provide better performance than or single map [4]- [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Binary compressed watermark is encrypted using combined binary key sequence {K i }. The binary key sequence {K i } is obtained by key sequence of logistic map and Lozi map [14]. So obtained watermark is encoded using (n, 1) repetition code.…”
Section: Introductionmentioning
confidence: 99%