Cryptologia · 1989 · 1K citations · 0 references
ComputingComputer ScienceMathematicsAlgorithmsComputer SecurityCryptographyChaos TheoryCryptographic AlgorithmsCryptographic ImplementationData EncryptionRandom Number GenerationConditionsCryptographic ApplicationsCryptographic Random Number GenerationEncryption AlgorithmsOne-time PadSecure Random Number Generation
Abstract 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. Keywords: Non-linear functionschaosrandom numbersone-time encryption