scholarly journals Design of Synchronized Large-Scale Chaos Random Number Generators and Its Application to Secure Communication

2019 ◽  
Vol 9 (1) ◽  
pp. 185 ◽  
Author(s):  
Teh-Lu Liao ◽  
Pei-Yen Wan ◽  
Jun-Juh Yan

This paper is concerned with the design of synchronized large-scale chaos random number generators (CRNGs) and its application to secure communication. In order to increase the diversity of chaotic signals, we firstly introduce additional modulation parameters in the original chaotic Duffing map system to modulate the amplitude and DC offset of the chaotic states. Then according to the butterfly effect, we implement modulated Duffing map systems with different initial values by using the microcontroller and complete the design of large-scale CRNGs. Next, a discrete sliding mode scheme is proposed to solve the synchronization problem of the master-slave large-scale CRNGs. Finally, we integrate the aforementioned results to implement an innovative secure communication system.

2009 ◽  
Vol 10 (1) ◽  
pp. 21-27
Author(s):  
Isaac Campos-Cantón ◽  
◽  
Eric Campos-Cantón ◽  
José Salomé Murguía-Ibarra ◽  
Mayra Elizabeth Chavira-Rodríguez ◽  
...  

1996 ◽  
Vol 07 (03) ◽  
pp. 295-303 ◽  
Author(s):  
P. D. CODDINGTON

Large-scale Monte Carlo simulations require high-quality random number generators to ensure correct results. The contrapositive of this statement is also true — the quality of random number generators can be tested by using them in large-scale Monte Carlo simulations. We have tested many commonly-used random number generators with high precision Monte Carlo simulations of the 2-d Ising model using the Metropolis, Swendsen-Wang, and Wolff algorithms. This work is being extended to the testing of random number generators for parallel computers. The results of these tests are presented, along with recommendations for random number generators for high-performance computers, particularly for lattice Monte Carlo simulations.


2019 ◽  
Vol 33 (24) ◽  
pp. 1950290 ◽  
Author(s):  
Ye Li ◽  
Haoping Wang ◽  
Yang Tian

A novel fractional-order adaptive non-singular terminal sliding mode control (FONTSMC) method is investigated for the synchronization of two nonlinear fractional-order chaotic systems in the presence of external disturbance. The proposed controller consists of a fractional-order non-singular terminal sliding mode surface and an adaptive gain adjusted with sliding surface. Based on Lyapunov stability theory and stability theorem for fractional-order dynamic systems, the controlled system’s stable synchronization is guaranteed. A dual-channel secure communication system is presented to transmit useful signals based on the proposed synchronization controller. Finally, numerical simulations and comparison with fractional-order PID controller, fractional-order PD sliding mode controller and adaptive terminal sliding mode controller are given to demonstrate the effectiveness and the robustness of the proposed FONTSMC control. The application of the proposed synchronization method is studied in the dual-channel secure communication.


2020 ◽  
Vol 2 (2) ◽  
pp. 121-126
Author(s):  
Fatin Nabila Abd Latiff ◽  
Wan Ainun Mior Othman

The purpose is to present a method for synchronizing a recurrent neural networks system between integer and fractional-order order delay by active sliding mode control . The Active Sliding Mode Control (ASMC) scheme is used to solve the synchronization problem between the integer-order delayed recurrent neural networks system via active sliding mode control (IoDRNNASM) systems and the fractional-order delay recurrent neural networks system via active sliding mode control (FoDRNNASM) system based on the Lyapunov direct fractional method (LDFM). To explore the behavior of the IoDRNNASM systems and the FoDRNNASM systems, we performed the technique of numerical simulations using MATLAB software to prove the feasibility and strength of the archived outcomes. This concept can also be enhanced with the implementation of double encryption using RSA encryption to secure communication. Because we expected in the future that this enhanced concept will strengthen and increase the network security capabilities that will provide powerful protection in secure communications.


2004 ◽  
Vol 14 (11) ◽  
pp. 3995-4008 ◽  
Author(s):  
WEIGUANG YAO ◽  
PEI YU ◽  
CHRISTOPHER ESSEX

In most published chaos-based communication schemes, the system's parameters used as a key could be intelligently estimated by a cracker based on the fact that information about the key is contained in the chaotic carrier. In this paper, we will show that the least significant digits (LSDs) of a signal from a chaotic system can be so highly random that the system can be used as a random number generator. Secure communication could be built between the synchronized generators nonetheless. The Lorenz system is used as an illustration.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Mauricio Zapateiro De la Hoz ◽  
Leonardo Acho ◽  
Yolanda Vidal

Security and secrecy are some of the important concerns in the communications world. In the last years, several encryption techniques have been proposed in order to improve the secrecy of the information transmitted. Chaos-based encryption techniques are being widely studied as part of the problem because of the highly unpredictable and random-look nature of the chaotic signals. In this paper we propose a digital-based communication system that uses the logistic map which is a mathematically simple model that is chaotic under certain conditions. The input message signal is modulated using a simple Delta modulator and encrypted using a logistic map. The key signal is also encrypted using the same logistic map with different initial conditions. In the receiver side, the binary-coded message is decrypted using the encrypted key signal that is sent through one of the communication channels. The proposed scheme is experimentally tested using Arduino shields which are simple yet powerful development kits that allows for the implementation of the communication system for testing purposes.


2012 ◽  
Vol 268-270 ◽  
pp. 1863-1868
Author(s):  
Yong Jin Yeom

The random number generator (RNG) is indispensable to modern cryptography since cryptographic services make use of random numbers for deriving encryption keys or nonces in protocols for secure communication. Operating systems like Linux and Windows provide built-in random number generators which can be accessed by cryptographic modules and other processes. If the system fails to collect sufficient entropy from the operating environment, the output from the RNG is blocked or becomes less secure. In this paper, we propose a method providing sufficient entropy to RNGs using graphics processing units. By estimating run-time of the kernel function in GPU, we can gather noisy data with bias. After the distillation process, we obtain a binary sequence for entropy input to the deterministic part of RNG. Our scheme was implemented on the computing environments using NVIDIA’s GPU GTX 580 and GTX 610M.


1992 ◽  
Vol 03 (03) ◽  
pp. 561-564 ◽  
Author(s):  
J.R. HERINGA ◽  
H.W.J. BLÖTE ◽  
A. COMPAGNER

The list of primitive binary trinomials with a degree equal to a Mersenne exponent is extended. The newly found primitive trinomials have a degree equal to the 29th and 30th Mersenne exponent. These trinomials enable the construction of new, high-performance random-number generators for use in large-scale Monte Carlo simulations.


Sign in / Sign up

Export Citation Format

Share Document