ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM

Robert Matthews · Cryptologia · 1989

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.

Read the paper · More papers on PaperTik