Loading…
Cryptography with chaotic mixing
We propose a cryptosystem based on one-dimensional chaotic maps of the form H p ( x ) = r p - 1 ∘ G ∘ r p ( x ) defined in the interval [0, 10 p ) for a positive integer parameter p, where G ( x ) = 10 x ( mod 10 ) and r p ( x ) = x p , which is a topological conjugacy between G and the shift map σ...
Saved in:
| Published in: | Chaos, solitons and fractals solitons and fractals, 2008-02, Vol.35 (3), p.466-471 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We propose a cryptosystem based on one-dimensional chaotic maps of the form
H
p
(
x
)
=
r
p
-
1
∘
G
∘
r
p
(
x
)
defined in the interval [0,
10
p
) for a positive integer parameter
p, where
G
(
x
)
=
10
x
(
mod
10
)
and
r
p
(
x
)
=
x
p
, 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)
H
p
is always chaotic for all parameters
p, (b) the knowledge of an ergodic measure allows assignments of the alphabetic symbols to equiprobable sites of
H
p
’s domain and (c) for each
p, the security of the cryptosystem is manageable against brute force attacks. |
|---|---|
| ISSN: | 0960-0779 1873-2887 |
| DOI: | 10.1016/j.chaos.2006.05.049 |