Discrete map · 1D · dim 1
PWLCM (piecewise-linear chaotic map)
A workhorse of chaos-based cryptography: simple, fast, uniform invariant density, large positive Lyapunov exponent, and parameter p easy to use as a key.
Equations
x_{n+1} = x_n / p if 0 < x_n ≤ p
= (x_n − p) / (0.5 − p) if p < x_n ≤ 0.5
= symmetric for x_n > 0.5At a glance
| Parameters | p ∈ (0, 0.5) |
|---|---|
| Chaotic for | always |
| Lyapunov exponent | λ = − [p log p + (0.5 − p) log(0.5 − p)] · 2 |
| History | Widely used in chaos cryptography since the 1990s. |
Try it
Open the interactive playground at /tools/cobweb.
See also
Quick quiz
Test yourself on pwlcm
8 multiple-choice questions. Pick an answer for each, then submit to see explanations.
Q1.PWLCM stands for:
Q2.PWLCMs are popular in chaos crypto because of:
Q3.The PWLCM parameter p lies in:
Q4.What invariant density does PWLCM have?
Q5.PWLCM is conjugate / similar to which other map?
Q6.A standard pitfall when implementing PWLCM in cryptography is:
Q7.Why is PWLCM faster than logistic for software encryption?
Q8.PWLCM-based ciphers are most commonly used for: