Interleaving Shifted Versions of a PN-Sequence

Cardell, Sara D.; Fúster‐Sabater, Amparo; Requena, Verónica

doi:10.3390/math9060687

Cited by 3 publications

(13 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The shifted versions of the sequence have a very poor correlation and crosscorrelation with other signals, such as interference and noise, is extremely low. The main disadvantage of PN codes is their small code family size, which means they only serve a small number of mobile users [23].…”

Section: Pn Sequencementioning

confidence: 99%

Implementation and performance evaluation of multi level pseudo random sequence generator

2023

View full text Add to dashboard Cite

In this paper, introduce a proposed multi-level pseudo-random sequence generator (MLPN). Characterized by its flexibility in changing generated pseudo noise (PN) sequence according to a key between transmitter and receiver. Also, introduce derive of the mathematical model for the MLPN generator. This method is called multi-level because it uses more than PN sequence arranged as levels to generation the pseudo-random sequence. This work introduces a graphical method describe the data processing through MLPN generation. This MLPN sequence can be changed according to changing the key between transmitter and receiver. The MLPN provides different pseudo-random sequence lengths. This work provides the ability to implement MLPN practically in more than one method such as microcontroller or field programmable gate array (FPGA). In this paper discusses MLPN performance using MATLAB as compared with golden PN sequence generator with different modulation schemes such as binary phase-shift keying (BPSK), quadrature phase-shift keying (QPSK), and quadrature amplitude modulation 16QAM. The simulation results show that MLPN performs almost likely golden PN sequence but sure with advantage its flexibility to change generated MLPN between transmitter and receiver. The MLPN sequence is applicable in the same field of PN sequence applications such as code division multiple access (CDMA), spread spectrum system (SSS), and data scrambling.

show abstract

Section: Pn Sequencementioning

confidence: 99%

Implementation and performance evaluation of multi level pseudo random sequence generator

2023

View full text Add to dashboard Cite

show abstract

“…Due to the characteristics of simple generation and low computational cost, one-dimensional chaotic maps are easier to implement in practical applications. Therefore, the one-dimensional chaotic maps in improved document [11] are used to generate pseudo-random sequences. Reference [11] proposes a mathematically simple and robust chaotic map with absolute value non-linearity, making it easier to implement on hardware.…”

Section: Algorithm Description Based On Chaosmentioning

confidence: 99%

“…Therefore, the one-dimensional chaotic maps in improved document [11] are used to generate pseudo-random sequences. Reference [11] proposes a mathematically simple and robust chaotic map with absolute value non-linearity, making it easier to implement on hardware. The chaotic mapping equation used in literature [11] is shown in Equation ( 6):…”

Section: Algorithm Description Based On Chaosmentioning

confidence: 99%

See 1 more Smart Citation

Research on encryption algorithms in terahertz communication systems

Ding

Cui

Feng

2023

Eighth International Conference on Electronic Technology and Information Science (ICETIS 2023)

View full text Add to dashboard Cite

Aiming at the problem that the terahertz wave beam is narrow and directionality is strong, which makes it easy for the enemy to eavesdrop on the data information, and thus the information cannot be transmitted safely, a pseudo-random sequence generation method based on n-LFSR and AV-NL chaotic mapping is proposed. Different algorithms are selected according to the number of LFSRs. At the same time, the absolute value nonlinear chaotic map is generalized. Finally, the generated two pseudo-random sequences are XOR combined to form the final pseudo-random sequence for source encryption. The simulation results show that this method takes into account the advantages of simple design of linear feedback shift register and high chaotic randomness. The generated pseudo-random sequence has both high linear complexity and the advantages of chaotic non-linearity. The high randomness used in source encryption can improve the security of the system.

show abstract

“…In [12], the authors proposed the interleaving of shifted versions of one single PNsequence considering these shifts (different from the ones used in the shrunken sequence) as part of the key. This idea makes even more difficult the cryptanalysis of such sequences.…”

Section: Introductionmentioning

confidence: 99%

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

2022

Self Cite

View full text Add to dashboard Cite

Binary PN-sequences generated by LFSRs exhibit good statistical properties; however, due to their intrinsic linearity, they are not suitable for cryptographic applications. In order to break such a linearity, several approaches can be implemented. For example, one can interleave several PN-sequences to increase the linear complexity. In this work, we present a deep randomness study of the resultant sequences of interleaving binary PN-sequences coming from different characteristic polynomials with the same degree. We analyze the period and the linear complexity, as well as many other important cryptographic properties of such sequences.

show abstract

Interleaving Shifted Versions of a PN-Sequence

Cited by 3 publications

References 26 publications

Implementation and performance evaluation of multi level pseudo random sequence generator

Implementation and performance evaluation of multi level pseudo random sequence generator

Research on encryption algorithms in terahertz communication systems

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

Contact Info

Product

Resources

About