Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

Bilan, Stepan; Bilan, Mykola; Bilan, Sergii

doi:10.1051/matecconf/201712502018

Cited by 8 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such environments, traditional rules of cell transition cannot be applied since cell states are not considered in their classical representation. However, the fundamentals of cellular automata technologies with active cells can rather be used, which are described in [27,28]. In this context, the active cell represents the robot's location at any given time.…”

Section: Robot Navigation Based On Cellular Technologiesmentioning

confidence: 99%

Enhancing Robot Navigation Efficiency Using Cellular Automata with Active Cells

Alzoubi,

Miraz

2024

AETiC

View full text Add to dashboard Cite

Enhancing robot navigation efficiency is a crucial objective in modern robotics. Robots relying on external navigation systems are often susceptible to electromagnetic interference (EMI) and encounter environmental disturbances, resulting in orientation errors within their surroundings. Therefore, the study employed an internal navigation system to enhance robot navigation efficacy under interference conditions, based on the analysis of the internal parameters and the external signals. This article presents details of the robot’s autonomous operation, which allows for setting the robot's trajectory using an embedded map. The robot’s navigation process involves counting the number of wheel revolutions as well as adjusting wheel orientation after each straight path section. In this article, an autonomous robot navigation system has been presented that leverages an embedded control navigation map utilising cellular automata with active cells which can effectively navigate in an environment containing various types of obstacles. By analysing the neighbouring cells of the active cell, the cellular environment determines which cell should become active during the robot’s next movement step. This approach ensures the robot’s independence from external control inputs. Furthermore, the accuracy and speed of the robot’s movement have been further enhanced using a hexagonal mosaic for navigation surface mapping. This concept of utilising on cellular automata with active cells has been extended to the navigation of a group of robots on a shared navigation surface, taking into account the intersections of the robots’ trajectories over time. To achieve this, a distance control module has been used that records the travelled trajectories in terms of wheel turns and revolutions.

show abstract

Section: Robot Navigation Based On Cellular Technologiesmentioning

confidence: 99%

Enhancing Robot Navigation Efficiency Using Cellular Automata with Active Cells

Alzoubi,

Miraz

2024

AETiC

View full text Add to dashboard Cite

show abstract

“…Other variation of the model is the asynchronous update of the cells' states. There are several examples in the scientific literature, of which we mention [31] because it is one of the few examples that use two-dimensional cellular automata (for 1-bit output) and also because it is designed as a randomization algorithm, not targeting the hardware implementation.…”

Section: Examples Based On Variations Of the Cellular Automata Modelmentioning

confidence: 99%

“…Since the late 1990s, the Diehard tests were used to assess the performances of cellular automata randomizers (like in Refs [26][27][28]). Most of the recent work evaluates the performances based on NIST test suite [24,30,31].…”

Section: Implementation and Applications Of Cellular Automata Randomimentioning

confidence: 99%

Cellular Automata and Randomization: A Structural Overview

Dascălu¹

2018

From Natural to Artificial Intelligence - Algorithms and Applications

View full text Add to dashboard Cite

The chapter overviews the methods, algorithms, and architectures for random number generators based on cellular automata, as presented in the scientific literature. The variations in linear and two-dimensional cellular automata model and their features are discussed in relation to their applications as randomizers. Additional memory layers, functional nonuniformity in space or time, and global feedback are examples of such variations. Successful applications of cellular automata random number/signal generators (both software and hardware) reported in the scientific literature are also reviewed. The chapter includes an introductory presentation of the mathematical (ideal) model of cellular automata and its implementation as a computing model, emphasizing some important theoretical debates regarding the complexity and universality of cellular automata.

show abstract

Selection of Intelligent Rules for the Evolution of Elementary Cellular Automata for Image Encryption

Bdour

2022

Wseas Transactions on Systems and Control

View full text Add to dashboard Cite

The paper is devoted to the search for new approaches to the formation of key arrays for encryption of color images. Emphasis is placed on using the initial key sequence of the smallest length. In this case, the key is the initial state of an elementary cellular automaton for implementing evolution based on a given rule. The use of an evolutionary approach on cellular automata to the formation of large key arrays made it possible to achieve unpredictable image encryption based on a single rule of an elementary cellular automata. The task of the research is to search for the rules of elementary cellular automata, which, based on a small initial key bit sequence, allow one to form a reliable key array of large dimensions for encrypting the bit layers that make up the image. To solve this problem, an experiment was carried out, on the basis of which the search for the necessary rules and options for choosing the elements of each bit array was carried out to encrypt the bit layers of the image. To form each bit key array, different initial conditions were used for elementary cellular automata. It is shown that for different initial conditions and for the chosen rules, the encryption quality is preserved. The most reliable encryption is the use of two key arrays formed on the basis of the evolution of one rule for different initial conditions. As a result of the experiments, the rules were determined (rules 90, 105, 150 and XOR function based on the two previous steps of evolution), which can be used without additional rules. Each bit layer of the image is encrypted using different subarrays of each generated one key array of the same dimension. It has been established that the most effective for encryption is the rule 105 and the XOR function based on the two previous steps of evolution. The resulting histograms of the distribution of brightness for each color of the encrypted image confirm the high quality of encryption based on the proposed method.

show abstract

Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

Cited by 8 publications

References 6 publications

Enhancing Robot Navigation Efficiency Using Cellular Automata with Active Cells

Enhancing Robot Navigation Efficiency Using Cellular Automata with Active Cells

Cellular Automata and Randomization: A Structural Overview

Selection of Intelligent Rules for the Evolution of Elementary Cellular Automata for Image Encryption

Contact Info

Product

Resources

About