Treffer: Generating pseudo-random numbers by combining two systems with complex behaviors

Title:
Generating pseudo-random numbers by combining two systems with complex behaviors
Authors:
SEYED MORTEZA HOSSEINI, KARIMI, Hossein, MAJID VAFAEI JAHAN
Source:
Journal of information security and applications. 19(2):149-162
Publisher Information:
Amsterdam: Elsevier, 2014.
Publication Year:
2014
Physical Description:
print, 3/4 p
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Security, safety, Sécurité (multidisciplinaire, général), Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Probabilités et statistiques, Probability and statistics, Théorie des probabilités et processus stochastiques, Probability theory and stochastic processes, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Probabilités et statistiques numériques, Numerical methods in probability and statistics, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Automate cellulaire, Cellular automaton, Autómata celular, Autoorganisation, Self organization, Autoorganización, Avalanche, Avalancha, Chaos, Caos, Corps fini, Finite field, Campo finito, Cryptographie, Cryptography, Criptografía, Efficacité, Efficiency, Eficacia, Entropie, Entropy, Entropía, Génération nombre aléatoire, Random number generation, Generación número aleatorio, Nombre aléatoire, Random number, Número aleatorio, Nombre pseudoaléatoire, Pseudorandom number, Número seudo aleatorio, Problème valeur initiale, Initial value problem, Problema valor inicial, Résultat expérimental, Experimental result, Resultado experimental, Suite aléatoire, Random sequence, Sucesión aleatoria, Système discret, Discrete system, Sistema discreto, Système dynamique, Dynamical system, Sistema dinámico, Test statistique, Statistical test, Test estadístico, Cellular arrays and automata, Computations in finite fields
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Software Engineering, Islamic Azad University, Mashhad Branch, Mashhad, Iran, Islamic Republic of
ISSN:
2214-2126
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=28612375
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics

Telecommunications and information theory
Accession Number:
edscal.28612375
Database:
PASCAL Archive

Weitere Informationen

Cellular automata (CA) due to its complex behavior has several applications such as generating random numbers and cryptography. Because of the intrinsic self-organized property, a pure CA cannot produce a long sequence of random numbers. Non-uniform, controllable/programmable CA or a combination of several automata can be used to increase the length of a produced sequence of random numbers. In this paper, a non-uniform CA as a random number generator has been combined with Langton's ants in order to generate random numbers. Langton's ant is a simple discrete dynamical system, with a surprisingly complex behavior. The combination of some Langton's ants gives them a chaotic behavior and combination of this behavior with complex behavior of cellular automata causes a great efficiency in generating random sequences. Experimental results show that, results given by the combination of ants and CA does not depend on initial value and shows a random behavior, resulting in cycles with very long period lengths and a limited number of cells such that a cycle length of 23n is obtained by n cells. Moreover, some tests such as entropy, avalanche, diehard, NIST and several basic statistical tests have been performed and all of them have been successfully passed.