Formation Methods, Models, and Hardware Implementation of Pseudorandom Number Generators

Bilan, Stepan

doi:10.4018/978-1-5225-2773-2

Cited by 7 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Today, the development of scientific research in the field of information technology, as well as scientific experiments using modeling, is increasingly being implemented on the basis of cellular automata (CA), which are built on new paradigms and models of their representation [2], [3], [7], [9], [15], [17]. CAs are a physical space of discrete elements that change their states in time, and, therefore, the state of the entire CA (the entire discrete physical space) changes in time.…”

mentioning

confidence: 99%

“…In modern literature, the evolution of two-dimensional cellular automata is represented by a sequence of two-dimensional arrays, which complicates the analysis of the dynamics of changes in the CA states over time [1], [2], [9], [7], [17]. Behavioral schemes in modeling the dynamics of changes in the states of various systems and the interaction of elements of such systems are mainly considered.…”

mentioning

confidence: 99%

“…This approach often gives a misconception about the behavior of the system [1], [13], [19], [22], [25]. Therefore, new effective forms of representing the evolution of two-dimensional cellular automata are now being sought [7], [9].…”

mentioning

confidence: 99%

“…Specialists pay a lot of attention to solving problems of a behavioral nature [9]. An effective application of TDCAs was found in the problems of information security [7] and image recognition [8]. In TDCA studies, evolution is represented as a set of two-dimensional pictures, which complicates the analysis of the evolution of transitions and the description of two-dimensional changes in states [7], [8], [9].…”

mentioning

confidence: 99%

See 3 more Smart Citations

Evolution of Two-Dimensional Cellular Automata. New Forms of Presentation

Bilan¹

2021

UJIT

View full text Add to dashboard Cite

The paper considers cellular automata and forms of reflection of their evolution. Forms of evolution of elementary cellular automata are known and widely used, which allowed specialists to model different dynamic processes and behavior of systems in different directions. In the context of the easy construction of the form of evolution of elementary cellular automata, difficulties arise in representing the form of evolution of two-dimensional cellular automata, both synchronous and asynchronous. The evolution of two-dimensional cellular automata is represented by a set of states of two-dimensional forms of cellular automata, which complicates the perception and determination of the dynamics of state change. The aim of this work is to solve the problem of a fixed mapping of the evolution of a two-dimensional cellular automaton in the form of a three-dimensional representation, which is displayed in different colors on a two-dimensional image The paper proposes the evolution of two-dimensional cellular automata in the form of arrays of binary codes for each cell of the field. Each time step of the state change is determined by the state of the logical "1" or "0". Moreover, each subsequent state is determined by increasing the binary digit by one. The resulting binary code identifies the color code that is assigned to the corresponding cell at each step of the evolution iteration. As a result of such coding, a two-dimensional color matrix (color image) is formed, which in its color structure indicates the evolution of a two-dimensional cellular automaton. To represent evolution, Wolfram coding was used, which increases the number of rules for a two-dimensional cellular automaton. The rules were used for the von Neumann neighborhood without taking into account the own state of the analyzed cell. In accordance with the obtained two-dimensional array of codes, a discrete color image is formed. The color of each pixel of such an image is encoded by the obtained evolution code of the corresponding cell of the two-dimensional cellular automaton with the same coordinates. The bitness of the code depends on the number of time steps of evolution. The proposed approach allows us to trace the behavior of the cellular automaton in time depending on its initial states. Experimental analysis of various rules for the von Neumann neighborhood made it possible to determine various rules that allow the shift of an image in different directions, as well as various affine transformations over images. Using this approach, it is possible to describe various dynamic processes and natural phenomena.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%