2005
DOI: 10.1007/s00034-005-2408-5
|View full text |Cite
|
Sign up to set email alerts
|

A More Secure Chaotic Cryptographic Scheme Based on the Dynamic Look-Up Table

Abstract: We have proposed a chaotic cryptographic scheme based on iterating the logistic map and updating the look-up table dynamically. However, it has been broken recently. In this paper, the weaknesses of the original dynamic look-up table scheme are analyzed and a more secure chaotic encryption scheme based on this dynamic look-up table concept is proposed. Theoretical analysis indicates that the modified scheme can resist the reported attacks. Moreover, simulation results show that this encryption scheme leads to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
24
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 51 publications
(24 citation statements)
references
References 14 publications
0
24
0
Order By: Relevance
“…Moreover these sequences are deterministic and reproducible. Recently, chaotic sequences have been adopted instead of random sequences and very interesting and somewhat good results have been shown in many applications such as secure transmission (Wong et al, 2005;Suneel, 2006), and nonlinear circuits (Arena et al, 2000), DNA computing (Manganaro & Pineda, 1997), image processing (Gao et al, 2006). The choice of chaotic sequences is justified theoretically by their unpredictability, i.e., by their spread-spectrum characteristic and ergodic properties.…”
Section: Chaotic Particle Swarm Optimization (Cpso)mentioning
confidence: 99%
“…Moreover these sequences are deterministic and reproducible. Recently, chaotic sequences have been adopted instead of random sequences and very interesting and somewhat good results have been shown in many applications such as secure transmission (Wong et al, 2005;Suneel, 2006), and nonlinear circuits (Arena et al, 2000), DNA computing (Manganaro & Pineda, 1997), image processing (Gao et al, 2006). The choice of chaotic sequences is justified theoretically by their unpredictability, i.e., by their spread-spectrum characteristic and ergodic properties.…”
Section: Chaotic Particle Swarm Optimization (Cpso)mentioning
confidence: 99%
“…Recently, chaotic sequences have been adopted instead of random sequences and very interesting and somewhat good results have been shown in many applications such as secure transmission, telecommunication and cryptography (Suneel, 2006;Wong, Man, Li, & Liao, 2005); nonlinear circuits (Arena, Caponetto, Fortuna, Rizzo, & La Rosa, 2000), and image processing (Gao, Zhang, Liang, & Li, 2006). Chaos is a bounded unstable dynamic behavior that exhibits sensitive dependence on initial conditions and includes infinite unstable periodic motions in nonlinear systems.…”
Section: Introductionmentioning
confidence: 98%
“…After its publication, improvements had been proposed from different aspects [2][3][4][5][6][7][8][9][10]. And several cryptanalysis schemes had been proposed to launch attack on the above-mentioned improvements[1 [1][2][3][4][5][6][7][8][9][10][11][12][13].…”
Section: Introductionmentioning
confidence: 99%