Abstract

In this paper we study characteristics of the Beta-transformation and its suitability as a candidate for implementation as a symmetric cryptosystem. For b > 1 the betatransformation is given by f ( x) x(mod1) b = b and xÎ[0,1] . It is well known that its Lyapunov exponent isl = logb . Sincel > 0 , it ensures that the beta-transformation is a non-linear chaotic system. Finally, we will also attempt to build a discrete version of the beta-transformation.