Cryptography with chaotic mixing

Luiz P.L. de Oliveira and Marcelo Sobottka

Chaos, Solitons & Fractals, 2008, vol. 35, issue 3, 466-471

Abstract: We propose a cryptosystem based on one-dimensional chaotic maps of the form Hp(x)=rp-1∘G∘rp(x) defined in the interval [0,10p) for a positive integer parameter p, where G(x)=10x(mod10) and rp(x)=xp, which is a topological conjugacy between G and the shift map σ on the space Σ of the sequences with 10 symbols. There are three advantages in comparison with the recently proposed cryptosystem based on chaotic logistic maps Fμ(x)=μx(1-x) with 3<μ⩽4: (a) Hp is always chaotic for all parameters p, (b) the knowledge of an ergodic measure allows assignments of the alphabetic symbols to equiprobable sites of Hp’s domain and (c) for each p, the security of the cryptosystem is manageable against brute force attacks.

Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077906004899
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:35:y:2008:i:3:p:466-471

DOI: 10.1016/j.chaos.2006.05.049

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().