Random Binary Sequences in Telecommunications

Sajic, Slavko; Maletić, Nebojša; Todorović, Branislav M.; Šunjevarić, Milan

doi:10.2478/jee-2013-0033

Cited by 7 publications

(9 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there is no signal in the first delay element, throughout this operation, all memory units will be empty at the end of ‘m’ shifts. A feedback loop is required to transform the shift register's content from a delay unit to a sequence generator [8] . The feedback loop provides the contents of a particular memory unit, referred to as taps of the XOR operation [9] based on the modulo 2 adder operation.…”

Section: Introductionmentioning

confidence: 99%

Sequential logic circuit gold codes for electronics and communication technologies

Devrari,

Kumar,

Kuchhal

et al. 2024

MethodsX

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Sequential logic circuit gold codes for electronics and communication technologies

Devrari,

Kumar,

Kuchhal

et al. 2024

MethodsX

View full text Add to dashboard Cite

“…Pseudo random binary sequences (PRBS) are widely used in many applications such as wireless communications and cryptography [1][2][3][4]. In cryptography, many security protocols such as SSL/TLS, HTTP are developed based on pseudo random sequences.…”

Section: Introductionmentioning

confidence: 99%

“…Such ideal random sequences can easily be produced from natural resources, for example, atmospheric noises, radioactive decay and other natural phenomena. However, reproducibility of such sequences is impossible mathematically because of variation in natural resources [4,5]. Due to this disadvantage, sources of such true random sequences are unreliable for practical computer applications.…”

Section: Introductionmentioning

confidence: 99%

Pseudo Random Binary Sequence Based on Cyclic Difference Set

Mamun

Akhter

2020

Symmetry

View full text Add to dashboard Cite

With the increasing reliance on technology, it has become crucial to secure every aspect of online information where pseudo random binary sequences (PRBS) can play an important role in today’s world of Internet. PRBS work in the fundamental mathematics behind the security of different protocols and cryptographic applications. This paper proposes a new PRBS namely MK (Mamun, Kumu) sequence for security applications. Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). Introduction of cyclic difference set makes a special contribution to randomness of proposed sequence while QR/QNR-based binarization ensures uniformity of zeros and ones in sequence. Besides, proposed sequence has maximum cycle length and high linear complexity which are required properties for sequences to be used in security applications. Several experiments are conducted to verify randomness and results are presented in support of robustness of the proposed MK sequence. The randomness of proposed sequence is evaluated by popular statistical test suite, i.e., NIST STS 800-22 package. The test results confirmed that the proposed sequence is not affected by approximations of any kind and successfully passed all statistical tests defined in NIST STS 800-22 suite. Finally, the efficiency of proposed MK sequence is verified by comparing with some popular sequences in terms of uniformity in bit pattern distribution and linear complexity for sequences of different length. The experimental results validate that the proposed sequence has superior cryptographic properties than existing ones.

show abstract

“…Due to this reason, in the literature, one can find a lot of publications on the use of chaos in this type of issue. Most of such research works apply to continuous distributions [8,9,10] and generating strings of binary values [11,12,13]. Non-uniform discrete distributions are practically not considered in the literature with the use of chaotic mappings.…”

Section: Introductionmentioning

confidence: 99%

Generation of Values From Discrete Probability Distributions With the Use of Chaotic Maps

Lawnik¹,

Banasik²,

Kapczyński³

2020

IJC

View full text Add to dashboard Cite

The values of random variables are commonly used in the field of artificial intelligence. The literature shows plenty of methods, which allows us to generate them, for example, inverse cumulative density function method. Some of the ways are based on chaotic projection. The chaotic methods of generating random variables are concerned with mainly continuous random variables. This article presents the method of generating values from discrete probability distributions with the use of properly constructed piece-wise linear chaotic map. This method is based on a properly constructed discrete dynamical system with chaotic behavior. Successive probability values cover the unit interval and the corresponding random variable values are assigned to the determined subintervals. In the next step, a piece-wise linear map on the subintervals is constructed. In the course of iterations of the chaotic map, consecutive values from a given discrete distribution are derived. The method is presented on the example of Bernoulli distribution. Furthermore, an analysis of the discussed example is conducted and shows that the presented method is the fastest of all analyzed methods.

show abstract

Random Binary Sequences in Telecommunications

Cited by 7 publications

References 41 publications

Sequential logic circuit gold codes for electronics and communication technologies

Sequential logic circuit gold codes for electronics and communication technologies

Pseudo Random Binary Sequence Based on Cyclic Difference Set

Generation of Values From Discrete Probability Distributions With the Use of Chaotic Maps

Contact Info

Product

Resources

About