Pseudorandom Sequence Generators

2012 ◽  
pp. 39-110
Keyword(s):  
Pseudorandom Sequence

scholarly journals The Dynamic Analysis of a Novel Reconfigurable Cubic Chaotic Map and Its Application in Finite Field

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1420
Author(s):  
Chuanfu Wang ◽  
Yi Di ◽  
Jianyu Tang ◽  
Jing Shuai ◽  
Yuchen Zhang ◽  
...  
Keyword(s):  
Secure Communication ◽  
Chaotic Map ◽  
Digital Circuit ◽  
Pseudorandom Sequence ◽  
Periodic Behavior ◽  
Output Sequence ◽  
Digital Devices ◽  
Theoretical And Numerical Analysis ◽  
Dynamic Degradation ◽  
Sequence Generator

Dynamic degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based pseudorandom sequence generators. The chaotic degradation shows complex periodic behavior, which is often ignored by designers and seldom analyzed in theory. Not knowing the exact period of the output sequence is the key problem that affects the application of chaos-based pseudorandom sequence generators. In this paper, two cubic chaotic maps are combined, which have symmetry and reconfigurable form in the digital circuit. The dynamic behavior of the cubic chaotic map and the corresponding digital cubic chaotic map are analyzed respectively, and the reasons for the complex period and weak randomness of output sequences are studied. On this basis, the digital cubic chaotic map is optimized, and the complex periodic behavior is improved. In addition, a reconfigurable pseudorandom sequence generator based on the digital cubic chaotic map is constructed from the point of saving consumption of logical resources. Through theoretical and numerical analysis, the pseudorandom sequence generator solves the complex period and weak randomness of the cubic chaotic map after digitization and makes the output sequence have better performance and less resource consumption, which lays the foundation for applying it to the field of secure communication.

The Effect of Pseudorandom Sequence Systematicity on Signal-to-Noise Ratio in Hadamard Transform Ion Mobility Spectrometry

2021 ◽  
Vol 76 (13) ◽  
pp. 1485-1492
Author(s):  
A. P. Sarycheva ◽  
A. Yu. Adamov ◽  
S. S. Lagunov ◽  
G. V. Lapshov ◽  
S. S. Poteshin ◽  
...  
Keyword(s):  
Ion Mobility Spectrometry ◽  
Ion Mobility ◽  
Signal To Noise Ratio ◽  
Hadamard Transform ◽  
Pseudorandom Sequence ◽  
Signal To Noise ◽  
Noise Ratio

scholarly journals An enhanced correlation identification algorithm and its application on spread spectrum induced polarization data

2021 ◽  
Vol 28 (2) ◽  
pp. 247-256
Author(s):  
Siming He ◽  
Jian Guan ◽  
Xiu Ji ◽  
Hang Xu ◽  
Yi Wang
Keyword(s):  
Data Processing ◽  
Spread Spectrum ◽  
Background Noise ◽  
Signal To Noise Ratio ◽  
Induced Polarization ◽  
High Resistivity ◽  
Observation System ◽  
Pseudorandom Sequence ◽  
Identification Algorithm ◽  
The Time Domain

Abstract. In spread spectrum induced polarization (SSIP) data processing, attenuation of background noise from the observed data is the essential step that improves the signal-to-noise ratio (SNR) of SSIP data. The time-domain spectral induced polarization based on pseudorandom sequence (TSIP) algorithm has been proposed to improve the SNR of these data. However, signal processing in background noise is still a challenging problem. We propose an enhanced correlation identification (ECI) algorithm to attenuate the background noise. In this algorithm, the cross-correlation matching method is helpful for the extraction of useful components of the raw SSIP data and suppression of background noise. Then the frequency-domain IP (FDIP) method is used for extracting the frequency response of the observation system. Experiments on both synthetic and real SSIP data show that the ECI algorithm will not only suppress the background noise but also better preserve the valid information of the raw SSIP data to display the actual location and shape of adjacent high-resistivity anomalies, which can improve subsequent steps in SSIP data processing and imaging.

scholarly journals AN EFFICIENT CHAOS-BASED OPTIMIZATION ALGORITHM APPROACH FOR CRYPTOGRAPHY

2012 ◽  
pp. 75-79
Author(s):  
RASHI VOHRA ◽  
BRAJESH PATEL
Keyword(s):  
Genetic Algorithm ◽  
Optimization Algorithm ◽  
Negative Impact ◽  
Chaotic Map ◽  
Pseudorandom Sequence ◽  
Secure Communications ◽  
Security Threats ◽  
Suggested Approach ◽  
Novel Approach ◽  
Algorithm Operation

The utmost negative impact of advancement of technology is an exponential increase in security threats, due to which tremendous demand for effective electronic security is increasing importantly. The principles of any security mechanism are confidentiality, authentication, integrity, non-repudiation, access control and availability. Cryptography is an essential aspect for secure communications. Many chaotic cryptosystem has been developed, as a result of the interesting relationship between the two field chaos and cryptography phenomenological behavior. In this paper, an overview of cryptography, optimization algorithm and chaos theory is provided and a novel approach for encryption and decryption based on chaos and optimization algorithms is discussed. In this article, the basic idea is to encrypt and decrypt the information using the concept of genetic algorithm with the pseudorandom sequence further used as a key in genetic algorithm operation for encryption: which is generated by application of chaotic map. This attempt result in good desirable cryptographic properties as a change in key will produce undesired result in receiver side. The suggested approach complements standard, algorithmic procedures, providing security solutions with novel features.

Image Encryption Algorithm Based on a Novel 4D Chaotic System

2021 ◽  
Vol 15 (4) ◽  
pp. 118-131
Author(s):  
Sadiq A. Mehdi
Keyword(s):  
Chaotic System ◽  
Initial Conditions ◽  
High Sensitivity ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Key Space ◽  
Xor Operation ◽  
Change Intensity ◽  
And Performance ◽  
Image Cryptosystem

In this paper, a novel four-dimensional chaotic system has been created, which has characteristics such as high sensitivity to the initial conditions and parameters. It also has two a positive Lyapunov exponents. This means the system is hyper chaotic. In addition, a new algorithm was suggested based on which they constructed an image cryptosystem. In the permutation stage, the pixel positions are scrambled via a chaotic sequence sorting. In the substitution stage, pixel values are mixed with a pseudorandom sequence generated from the 4D chaotic system using XOR operation. A simulation has been conducted to evaluate the algorithm, using the standardized tests such as information entropy, histogram, number of pixel change rate, unified average change intensity, and key space. Experimental results and performance analyses demonstrate that the proposed encryption algorithm achieves high security and efficiency.

An Improved Rao–Nam Cryptosystem Based on Fractional Order Hyperchaotic System and EDF–QC–LDPC

2019 ◽  
Vol 29 (09) ◽  
pp. 1950122 ◽  
Author(s):  
Jie Liu ◽  
Xiaojun Tong ◽  
Zhu Wang ◽  
Jing Ma ◽  
Longteng Yi
Keyword(s):  
Error Correction ◽  
Fractional Order ◽  
High Capacity ◽  
Pseudorandom Sequence ◽  
Hyperchaotic System ◽  
Difference Family ◽  
Parity Check ◽  
Chosen Plaintext Attack ◽  
Low Density Parity Check ◽  
Security And Reliability

A Rao–Nam cryptosystem based on error correction code is proposed to provide both security and reliability. Since its security is drastically constrained by the limited error syndromes, in this paper, an improved Rao–Nam cryptosystem based on fractional order hyperchaotic system and Extended Difference Family–Quasi-Cyclic–Low-Density Parity-Check (EDF–QC–LDPC) codes is proposed to improve the security. A four-dimensional fractional order hyperchaotic system is constructed and is used to generate an excellent pseudorandom sequence. By replacing error syndromes with the pseudorandom sequence and permuting the coded message dynamically, the security of the Rao–Nam cryptosystem is enhanced greatly. The ability of the improved Rao–Nam cryptosystem against known attacks is analyzed and the error correction performance with different parameters is simulated. The results show that the proposed cryptosystem has a significant advantage of resisting the chosen-plaintext attack. Moreover, the proposed cryptosystem retains high capacity of error correction.

scholarly journals A Lightweight Image Encryption Algorithm Based on Message Passing and Chaotic Map

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Jianwen Zou ◽  
Linquan Huang ◽  
Yifan Liu
Keyword(s):  
Image Encryption ◽  
Message Passing ◽  
High Speed ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Pseudorandom Sequences ◽  
Plain Image ◽  
Image Encryption Algorithm

The popularization of 5G and the development of cloud computing further promote the application of images. The storage of images in an untrusted environment has a great risk of privacy leakage. This paper outlines a design for a lightweight image encryption algorithm based on a message-passing algorithm with a chaotic external message. The message-passing (MP) algorithm allows simple messages to be passed locally for the solution to a global problem, which causes the interaction among adjacent pixels without additional space cost. This chaotic system can generate high pseudorandom sequences with high speed performance. A two-dimensional logistic map is utilized as a pseudorandom sequence generator to yield the external message sets of edge pixels. The external message can affect edge pixels, and then adjacent pixels interact with each other to produce an encrypted image. A MATLAB simulation shows the cipher-image performs fairly uniform distribution and has acceptable information entropy of 7.996749. The proposed algorithm reduces correlation coefficients from plain-image 1 to its cipher-image 0, which covers all of the plain-image characters with high computational efficiency (speed = 18.200374 Mbit/s). Theoretical analyses and experimental results prove the proposed algorithm’s persistence to various existing attacks with low cost.

Sign in / Sign up

Export Citation Format

Share Document