Design of a generalized bidirectional tent map suitable for encryption applications

The discrete tent map is one of the most famous discrete chaotic maps that has widely-spread applications. This paper investigates a set of four generalized tent maps where the conventional map is a special case. The proposed maps have extra degrees of freedom which provide different chaotic characteristics and increase the design flexibility required for many applications. Mathematical analyses for generalized positive and mostly positive tent maps include: bifurcation diagrams relative to all parameters, effective range of parameters, bifurcation points. The maximum Lyapunov exponent (MLE) is also calculated to indicate chaotic behavior. Various scales of the bifurcation diagram are discussed for each generalized map as well as system responses versus the added parameters.