On the Derivation of a "Chaotic" Encryption Algorithm

Under certain conditions, even simple non-linear iterative functions are capable of generating “chaotic” sequences of random numbers. In this paper we derive such a “chaotic” function, and show that it may be suitable for cryptographic use, in particular as a replacement for the one-time pad system.