Thumbnail
Access Restriction
Open

Subject Keyword MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS ♦ PHYSICS ♦ CRYPTOGRAPHY ♦ DYNAMICS ♦ INFORMATION THEORY ♦ SECURITY ♦ ATTRACTORS ♦ PHASE SPACE ♦ NEURAL NETWORKS ♦ CONTROL THEORY ♦ STOCHASTIC PROCESSES ♦ DYNAMICAL SYSTEMS ♦ CHAOTIC SYSTEMS ♦ AUTOMATA
Abstract In this paper, a new cryptosystem using dynamical systems is introduced which features storing information in stable configurations of dynamical systems but representing the information in arbitrary configurations of dynamical systems. The message {ital p} in a plaintext can be considered as a stable configuration of a dynamical system. The encrypted string of {ital p} in a ciphertext is an arbitrary configuration which will lead the dynamical system to the attractor defined by the original string {ital p}. The encryption procedure, {ital C}={ital E}({ital p}), treats a string in a plaintext as an attractor of a finite dynamical system, and will generate a configuration {ital C} randomly, as long as the configuration leads to a correct attractor. The decryption procedure regenerates attractors of a dynamical system, {ital p}={ital D}({ital C})={ital D}({ital E}({ital p})), from the configurations contained in the ciphertext. Three families of cryptosystems (simple, compound, and stochastic cryptosystems) are presented. {copyright} {ital 1996 American Institute of Physics.}
ISSN 0094243X
Educational Use Research
Learning Resource Type Article
Publisher Date 1996-06-01
Publisher Place United States
Volume Number 375
Issue Number 1
Technical Publication No. CONF-950730-


Open content in new tab

   Open content in new tab