Log in

Relevant bibliographies by topics / Pseudo-random sequence / Journal articles

To see the other types of publications on this topic, follow the link: Pseudo-random sequence.

Journal articles on the topic 'Pseudo-random sequence'

Author: Grafiati

Published: 30 May 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Pseudo-random sequence.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Tsatsin, A. A. "Synthetic pseudo-random sequence." IOP Conference Series: Materials Science and Engineering 1027 (January 12, 2021): 012028. http://dx.doi.org/10.1088/1757-899x/1027/1/012028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kramosil, Ivan. "On Pseudo-Random Sequences over Finite Automata." Fundamenta Informaticae 8, no. 1 (1985): 55–62. http://dx.doi.org/10.3233/fi-1985-8104.

Full text

Abstract:

It is a well-known fact that binary sequences (strings) of high algorithmic complexity can be taken as good approximations of statistically independent random sequences with two equiprobable outputs. Here “sequence of high algorithmic complexity” is such one, that the length of the shortest program generating this sequence by a universal Turing machine differs only by an a priori given constant from the length of the generated sequence. The present paper generalizes this result to the case of a finite (not necessarily binary) alphabet. Considering an infinite sequence of finite sequences of hi

APA, Harvard, Vancouver, ISO, and other styles

3

Rudnytskyi, V., V. Larin, and D. Pidlasyi. "EVALUATION OF STATISTICAL PROPERTIES OF ENCRYPTION RESULTS BASED ON INFORMATION-DRIVEN OPERATIONS." Наукові праці Державного науково-дослідного інституту випробувань і сертифікації озброєння та військової техніки 22, no. 4 (2024): 121–27. https://doi.org/10.37701/dndivsovt.22.2024.15.

Full text

Abstract:

The article evaluates the statistical properties of the results of encryption of pseudo-random sequences based on information-driven operations. The importance and significance of the use of pseudo-random sequences for optimizing the structural characteristics of systems (complexes, samples) of weapons and military equipment and their components are shown. It is noted that the period of the pseudo-random sequence should be such that the final sequence of adequate length is periodic. Relatively short non-periodic subsequences should be as indistinguishable as possible from random sequences, in

APA, Harvard, Vancouver, ISO, and other styles

4

Mamun, Md Selim Al, and Fatema Akhter. "Pseudo Random Binary Sequence Based on Cyclic Difference Set." Symmetry 12, no. 8 (2020): 1202. http://dx.doi.org/10.3390/sym12081202.

Full text

Abstract:

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). Introd

APA, Harvard, Vancouver, ISO, and other styles

5

Borbély, József, and András Sárközy. "Quasi-Random Graphs, Pseudo-Random Graphs and Pseudorandom Binary Sequences, I. (Quasi-Random Graphs)." Uniform distribution theory 14, no. 2 (2019): 103–26. http://dx.doi.org/10.2478/udt-2019-0017.

Full text

Abstract:

AbstractIn the last decades many results have been proved on pseudo-randomness of binary sequences. In this series our goal is to show that using many of these results one can also construct large families of quasi-random, pseudo-random and strongly pseudo-random graphs. Indeed, it will be proved that if the first row of the adjacency matrix of a circulant graph forms a binary sequence which possesses certain pseudorandom properties (and there are many large families of binary sequences known with these properties), then the graph is quasi-random, pseudo-random or strongly pseudo-random, respe

APA, Harvard, Vancouver, ISO, and other styles

6

Journal, Baghdad Science. "Stochastic Non-Linear Pseudo-Random Sequence Generator." Baghdad Science Journal 7, no. 2 (2010): 1042–46. http://dx.doi.org/10.21123/bsj.7.2.1042-1046.

Full text

Abstract:

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence

APA, Harvard, Vancouver, ISO, and other styles

7

Shamran, Mahmood A. "Stochastic Non-Linear Pseudo-Random Sequence Generator." Baghdad Science Journal 7, no. 2 (2010): 1042–46. http://dx.doi.org/10.21123/bsj.2010.7.2.1042-1046.

Full text

Abstract:

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence

APA, Harvard, Vancouver, ISO, and other styles

8

Unkašević, Tomislav, Zoran Banjac, and Milan Milosavljević. "A Generic Model of the Pseudo-Random Generator Based on Permutations Suitable for Security Solutions in Computationally-Constrained Environments." Sensors 19, no. 23 (2019): 5322. http://dx.doi.org/10.3390/s19235322.

Full text

Abstract:

Symmetric cryptography methods have an important role in security solutions design in data protection. In that context, symmetric cryptography algorithms and pseudo-random generators connected with them have strong influence on designed security solutions. In the computationally constrained environment, security efficiency is also important. In this paper we proposed the design of a new efficient pseudo-random generator parameterized by two pseudo-random sequences. By the probabilistic, information-theoretic and number theory methods we analyze characteristics of the generator. Analysis produc

APA, Harvard, Vancouver, ISO, and other styles

9

Azhmukhamedov, Iscandar Maratovich, and Evgeny Melnikov. "Upper bound of probability of receiving error of aperiodic pseudo-random sequence at jamming." Vestnik of Astrakhan State Technical University. Series: Management, computer science and informatics 2020, no. 1 (2020): 64–72. http://dx.doi.org/10.24143/2072-9502-2020-1-64-72.

Full text

Abstract:

The article discusses the obtained estimate of the upper bounds for the probable receiving error of the synchronizing sequence during sensor phasing of aperiodic pseudo-random sequences (CRR) in broadband communication systems in the channels of low quality with strong disturbances of natural and organized structure. The obtained results allow to design synchronization systems of pseudo-random sequences for the worst case, which guarantees their reliable operation in low-quality channels, and, unlike the well-known methods, the estimation of synchronization of aperiodic pseudo-random sequence

APA, Harvard, Vancouver, ISO, and other styles

10

Maksymovych, Volodymyr, Mariia Shabatura, Oleh Harasymchuk, Ruslan Shevchuk, Pawel Sawicki, and Tomasz Zajac. "Combined Pseudo-Random Sequence Generator for Cybersecurity." Sensors 22, no. 24 (2022): 9700. http://dx.doi.org/10.3390/s22249700.

Full text

Abstract:

Random and pseudo-random number and bit sequence generators with a uniform distribution law are the most widespread and in demand in the market of pseudo-random generators. Depending on the specific field of application, the requirements for their implementation and the quality of the generator’s output sequence change. In this article, we have optimized the structures of the classical additive Fibonacci generator and the modified additive Fibonacci generator when they work together. The ranges of initial settings of structural elements (seed) of these generators have been determined, which gu

APA, Harvard, Vancouver, ISO, and other styles

11

Rai, Jitender, and Farooq Seeru. "Chaos-based pseudo-random binary sequence generator." Global Sci-Tech 10, no. 1 (2018): 1. http://dx.doi.org/10.5958/2455-7110.2018.00001.0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Álvarez, Rafael, Francisco Martínez, and Antonio Zamora. "Improving the Statistical Qualities of Pseudo Random Number Generators." Symmetry 14, no. 2 (2022): 269. http://dx.doi.org/10.3390/sym14020269.

Full text

Abstract:

Pseudo random and true random sequence generators are important components in many scientific and technical fields, playing a fundamental role in the application of the Monte Carlo methods and stochastic simulation. Unfortunately, the quality of the sequences produced by these generators are not always ideal in terms of randomness for many applications. We present a new nonlinear filter design that improves the output sequences of common pseudo random generators in terms of statistical randomness. Taking inspiration from techniques employed in symmetric ciphers, it is based on four seed-depend

APA, Harvard, Vancouver, ISO, and other styles

13

Bagdasar, Ovidiu, Minsi Chen, Vasile Drăgan, Ivan Ganchev Ivanov, and Ioan-Lucian Popa. "On Horadam Sequences with Dense Orbits and Pseudo-Random Number Generators." Mathematics 11, no. 5 (2023): 1244. http://dx.doi.org/10.3390/math11051244.

Full text

Abstract:

Horadam sequence is a general recurrence of second order in the complex plane, depending on four complex parameters (two initial values and two recurrence coefficients). These sequences have been investigated over more than 60 years, but new properties and applications are still being discovered. Small parameter variations may dramatically impact the sequence orbits, generating numerous patterns: periodic, convergent, divergent, or dense within one dimensional curves. Here we explore Horadam sequences whose orbit is dense within a 2D region of the complex plane, while the complex argument is u

APA, Harvard, Vancouver, ISO, and other styles

14

Savova, Zhaneta N., Antoniya T. Tasheva, and Rosen A. Bogdanov. "Method for the Simultaneous Generation of Two Nonlinear Pseudo Random Sequences: 5-ary and Binary." WSEAS TRANSACTIONS ON ELECTRONICS 14 (December 31, 2023): 71–78. http://dx.doi.org/10.37394/232017.2023.14.9.

Full text

Abstract:

Multi-level signals and sequences have become a significant aspect of modern high-speed communication systems. Hence, to ensure the confidentiality and integrity of the transmitted information, advanced methods and devices are necessary to produce strong cryptographic properties for not only binary but also for nonbinary keystreams, which can be used in resource-constrained microcontrollers. The proposed method and apparatus generate both a balanced nonlinear 5-ary pseudo-random sequence and a binary keystream sequence. The nonlinearity is determined by applying shrinking and multiplexing tech

APA, Harvard, Vancouver, ISO, and other styles

15

ELENA A., KULESHOVA, MARUKHLENKO ANATOLY L., DOBRITSA VYACHESLAV P., TANYGIN MAXIM O., and PLUGATAREV ALEXEY V. "A VARIANT OF THE ALGORITHM FOR GENERATING PSEUDO-RANDOM BINARY SEQUENCES BASED ON THE PROPERTIES OF LINEAR CELLULAR AUTOMATA." CASPIAN JOURNAL: Control and High Technologies 54, no. 2 (2021): 62–70. http://dx.doi.org/10.21672/2074-1707.2021.53.1.062-070.

Full text

Abstract:

The article is devoted to the development of a linear system for generating a pseudo-random sequence based on cellular automata, the development of a model for several generators of nonlinear pseudo-random sequences with practical applications in symmetric data transformation systems. Such a model generates all solutions to linear binary difference equations. It is important to note that many of these solutions are pseudo-random keystream sequences. In the process of developing a linear system based on cellular automata, two main structures are considered: linear difference equations and one-d

APA, Harvard, Vancouver, ISO, and other styles

16

Chiang, Yi Te, He Sheng Wang, and Yung Nien Wang. "A Chaotic-Based Pseudo-Random Bit Generator for Navigation Applications." Applied Mechanics and Materials 311 (February 2013): 99–104. http://dx.doi.org/10.4028/www.scientific.net/amm.311.99.

Full text

Abstract:

In this paper, we propose a novel method to generate pseudo-random-noise (PRN) bits for navigation applications. In the present method, the code sequence generator is constructed based on two chaotic logistic maps running parallel and starting from independent initial conditions. The logistic map is a simple mathematical model that shows bewildering complex behavior. By appro-priately setting the initial conditions, the PRN sequence is then generated by comparing the outputs of both logistic maps. Several simulations are set up to verify the correlation properties of the pseudo-random bit gene

APA, Harvard, Vancouver, ISO, and other styles

17

Ahmad, A., and A. Al Maashri. "On Sequence Lengths of Some Special External Exclusive OR Type LFSR Structures – Study and Analysis." Journal of Engineering Research [TJER] 11, no. 2 (2014): 1. http://dx.doi.org/10.24200/tjer.vol11iss2pp1-14.

Full text

Abstract:

The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs) plays an important role in the design approaches of built-in selftest, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in some situations. Given that determining the length of generated pseudo-random binary sequence is a complex task, therefore, before using an LFSR structure, it is essential to investigate the length and the properties of the sequence. This paper investigates some conditions and LFSR’s structures, which restrict the p

APA, Harvard, Vancouver, ISO, and other styles

18

Cai Jue-Ping, Li Zan, and Song Wen-Tao. "Analysis on the chaotic pseudo-random sequence complexity." Acta Physica Sinica 52, no. 8 (2003): 1871. http://dx.doi.org/10.7498/aps.52.1871.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Mita, R., G. Palumbo, and M. Poli. "Pseudo-random sequence generators with improved inviolability performance." IEE Proceedings - Circuits, Devices and Systems 153, no. 4 (2006): 375. http://dx.doi.org/10.1049/ip-cds:20050314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Ma, Tengyu, Jun Ye, Zheng Xu, and Jinghua Zhao. "Image Encryption Algorithm based on Pseudo-random Sequence." Procedia Computer Science 243 (2024): 1231–38. http://dx.doi.org/10.1016/j.procs.2024.09.145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Feng, Yelai, Huaixi Wang, Chao Chang, Hongyi Lu, Fang Yang, and Chenyang Wang. "A Novel Nonlinear Pseudorandom Sequence Generator for the Fractal Function." Fractal and Fractional 6, no. 10 (2022): 589. http://dx.doi.org/10.3390/fractalfract6100589.

Full text

Abstract:

A pseudorandom sequence is a repeatable sequence with random statistical properties that is widely used in communication encryption, authentication and channel coding. The pseudorandom sequence generator based on the linear feedback shift register has the problem of a fixed sequence, which is easily tracked. Existing methods use the secret linear feedback shift register (LFSR) and built-in multiple LFSRs and is difficult to prevent cracking based on the hardware analysis. Since the plaintext depends on a specific language to be generated, using pseudo-random sequence encryption, it faces the p

APA, Harvard, Vancouver, ISO, and other styles

22

Elahi, Ahsan, Qidan Zhu, Jun Lu, Zahid Hammad, Muhammad Bilal, and Yong Li. "Single-Shot, Pixel-Encoded Strip Patterns for High-Resolution 3D Measurement." Photonics 10, no. 11 (2023): 1212. http://dx.doi.org/10.3390/photonics10111212.

Full text

Abstract:

In this research, we combined two distinct, structured light methods, the single-shot pseudo-random sequence-based approach and the time-multiplexing stripe indexing method. As a result, the measurement resolution of the single-shot, spatially encoded, pseudo-random sequence-based method improved significantly. Since the time-multiplexed stripe-indexed-based techniques have a higher measurement resolution, we used varying stripes to enhance the measurement resolution of the pseudo-random sequence-based approaches. We suggested a multi-resolution 3D measurement system that consisted of horizont

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Yan Chun, and Chang Wei Sun. "The Application of Pseudo-Random Sequence in the Properties Measurement of Polymer Optical Fiber." Applied Mechanics and Materials 313-314 (March 2013): 653–57. http://dx.doi.org/10.4028/www.scientific.net/amm.313-314.653.

Full text

Abstract:

A new method for the properties measurement of polymer optical fiber (POF) using pseudo-random sequence is introduced. The light source modulated by pseudo-random sequence is injected into the POF. The output optical signal after photoelectric conversion is made the correlation detection with pseudo-random sequence, and finally the correlation operation is carried out based on Labview software. Because pseudo-random sequence performs well on randomicity and it has the correlation properties similar to that of white noise, interference and noise have little influence on the peak of correlation

APA, Harvard, Vancouver, ISO, and other styles

24

Pasqualini, Luca, and Maurizio Parton. "Pseudo Random Number Generation through Reinforcement Learning and Recurrent Neural Networks." Algorithms 13, no. 11 (2020): 307. http://dx.doi.org/10.3390/a13110307.

Full text

Abstract:

A Pseudo-Random Number Generator (PRNG) is any algorithm generating a sequence of numbers approximating properties of random numbers. These numbers are widely employed in mid-level cryptography and in software applications. Test suites are used to evaluate the quality of PRNGs by checking statistical properties of the generated sequences. These sequences are commonly represented bit by bit. This paper proposes a Reinforcement Learning (RL) approach to the task of generating PRNGs from scratch by learning a policy to solve a partially observable Markov Decision Process (MDP), where the full sta

APA, Harvard, Vancouver, ISO, and other styles

25

Hadeer, Hussein Ali, T. Ziboon Hadi, and Q. Hameed Ashwaq. "Implementation and performance evaluation of multi level pseudo random sequence generator." Bulletin of Electrical Engineering and Informatics 12, no. 2 (2023): 822~834. https://doi.org/10.11591/eei.v12i2.3363.

Full text

Abstract:

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 tran

APA, Harvard, Vancouver, ISO, and other styles

26

Gnatyuk, Sergiy, Yuliia Burmak, Rat Berdibayev, Marek Aleksander, and Dinara Ospanova. "METHOD FOR DEVELOPING PSEUDO-RANDOM NUMBER GENERATORS FOR CRYPTOGRAPHIC APPLICATIONS IN 5G NETWORKS." Cybersecurity: Education, Science, Technique 12, no. 4 (2021): 151–62. http://dx.doi.org/10.28925/2663-4023.2021.12.151162.

Full text

Abstract:

Today, pseudo-random number generators are used in various systems and applications, including as key generators in stream ciphers. The implementation of the latest information and communication technologies (in particular, 5G networks) strengthens the requirements for ensuring the confidentiality of critical data and forces the development of new methods and means for cryptographic protection. Existing generators, like other cryptographic algorithms, do not meet the requirements for processing speed and security against known types of attacks. From this position, in the paper a method for con

APA, Harvard, Vancouver, ISO, and other styles

27

Liao, Chun Guang, and Ping Liu. "Performance Analysis of Chaotic Spread Spectrum Sequences." Advanced Materials Research 852 (January 2014): 608–12. http://dx.doi.org/10.4028/www.scientific.net/amr.852.608.

Full text

Abstract:

The properties of chaotic maps based on Logistic map, Tent map, Improved Logistic map and Chebyshev map are analyzed in this paper .Then we discuss the performance of correlation, balance and run-length of the chaotic binary sequences . Simulation results show that the characteristics of chaotic sequences are similar to the traditional pseudo-random sequences, and chaotic sequence is suitable for direct sequence spread spectrum systems as spreading sequence.

APA, Harvard, Vancouver, ISO, and other styles

28

WANG, XING-YUAN, and YI-XIN XIE. "A DESIGN OF PSEUDO-RANDOM BIT GENERATOR BASED ON SINGLE CHAOTIC SYSTEM." International Journal of Modern Physics C 23, no. 03 (2012): 1250024. http://dx.doi.org/10.1142/s0129183112500246.

Full text

Abstract:

Pseudo-random bit sequence have a wide range of applications in the field of cryptography and communications. For the good chaotic dynamical properties of chaotic systems sequence such as randomness and initial sensitivity, chaotic systems have a strong advantage in generating the pseudo-random bit sequence. However, in practical use, the dynamical properties of chaotic systems will be degraded because of the limited calculation accuracy and it even could cause a variety of security issues. To improve the security, in full analyses of the pseudo-random bit generator proposed in our former pape

APA, Harvard, Vancouver, ISO, and other styles

29

Ali, Hadeer Hussein, Hadi T. Ziboon, and Ashwaq Q. Hameed. "Implementation and performance evaluation of multi level pseudo random sequence generator." Bulletin of Electrical Engineering and Informatics 12, no. 2 (2023): 822–34. http://dx.doi.org/10.11591/eei.v12i2.3363.

Full text

Abstract:

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 tran

APA, Harvard, Vancouver, ISO, and other styles

30

Zeng, Xuezhi, Albert Monteith, Andreas Fhager, Mikael Persson, and Herbert Zirath. "Noise performance comparison between two different types of time-domain systems for microwave detection." International Journal of Microwave and Wireless Technologies 9, no. 3 (2016): 535–42. http://dx.doi.org/10.1017/s175907871600057x.

Full text

Abstract:

This paper compares the noise performance of two different types of time-domain microwave detection systems: a pulsed system and a pseudo-random noise sequence system. System-level simulations and laboratory-based measurements are carried out in the study. Results show that the effect of timing jitter is more significant on the measurement accuracy of the pseudo-random noise sequence system than that of the pulsed system. Although the signal power density of the pseudo-random sequence system is tens of dBs higher than that of the pulsed system over the frequency band of interest, the signal-to

APA, Harvard, Vancouver, ISO, and other styles

31

MURGUÍA, J. S., M. MEJÍA CARLOS, H. C. ROSU, and G. FLORES-ERAÑA. "IMPROVEMENT AND ANALYSIS OF A PSEUDO-RANDOM BIT GENERATOR BY MEANS OF CELLULAR AUTOMATA." International Journal of Modern Physics C 21, no. 06 (2010): 741–56. http://dx.doi.org/10.1142/s0129183110015440.

Full text

Abstract:

In this paper, we implement a revised pseudo-random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix HNwith the aim of calculating the pseudo-random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix HNis revealed and quantified according to the multifractal formalism. The latter analysis could help to disentangle what kind of automaton rule is used in the randomization process and therefore it could be useful in cryptanalysis. Moreover, the conditions

APA, Harvard, Vancouver, ISO, and other styles

32

Jing Chai, Jing Chai, Mingjiang Zhang Mingjiang Zhang, Yi Liu Yi Liu, Lan Li Lan Li, Weipeng Xu Weipeng Xu, and Yuncai Wang Yuncai Wang. "Distributed fiber temperature sensor using a laser diode modulated by a pseudo-random bit sequence." Chinese Optics Letters 13, no. 8 (2015): 080604–80607. http://dx.doi.org/10.3788/col201513.080604.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Gasimov, V. A., J. I. Mammadov, and E. A. Mustaphayeva. "Intersymbol interval method for hiding secret information based on pseudo-random number sequences." Problems of Informatization and Management 1, no. 69 (2022): 18–23. http://dx.doi.org/10.18372/2073-4751.69.16808.

Full text

Abstract:

In the article, an efficient method of hiding secret information in text-type containers based on changing inter-symbol intervals is suggested. Here, the hiding process is performed by selecting the symbols of the container in a pseudo-random sequence to increase reliability. To obtain a pseudo-random sequence the linear congruent method and Feigenbaum's quadratic function were used.

APA, Harvard, Vancouver, ISO, and other styles

34

Ma, Jiang, Wei Zhao, Yanguo Jia, and Haiyang Jiang. "New Generalized Cyclotomic Quaternary Sequences with Large Linear Complexity and a Product of Two Primes Period." Information 12, no. 5 (2021): 193. http://dx.doi.org/10.3390/info12050193.

Full text

Abstract:

Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength. Pseudo-random Sequences with a large linear complexity property are of importance in many domains. In this paper, based on the theory of inverse Gray mapping, two classes of new generalized cyclotomic quaternary sequences with period pq are constructed, where pq is a product of two large distinct primes. In addition, we give the linear complexity over the residue class ring Z4 via the Hamming weights of their Fourie

APA, Harvard, Vancouver, ISO, and other styles

35

Nagy, Shady Ahmed, Mohamed A. El-Beltagy, and Mohamed Wafa. "Multilevel Monte Carlo by using the Halton sequence." Monte Carlo Methods and Applications 26, no. 3 (2020): 193–203. http://dx.doi.org/10.1515/mcma-2020-2065.

Full text

Abstract:

AbstractMonte Carlo (MC) simulation depends on pseudo-random numbers. The generation of these numbers is examined in connection with the Brownian motion. We present the low discrepancy sequence known as Halton sequence that generates different stochastic samples in an equally distributed form. This will increase the convergence and accuracy using the generated different samples in the Multilevel Monte Carlo method (MLMC). We compare algorithms by using a pseudo-random generator and a random generator depending on a Halton sequence. The computational cost for different stochastic differential e

APA, Harvard, Vancouver, ISO, and other styles

36

Zheng, Sheng Jia, Jian Jun Liu, and Tie Jun Li. "Dynamic-Pseudo-Random Test Sequence Generation Technique with Low Power Consumption." Key Engineering Materials 474-476 (April 2011): 655–60. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.655.

Full text

Abstract:

In order to provide low power consumption LFSR seed for BIST structure，this paper proposed a seed calculation Methods of dynamic-pseudo-random test sequence, it can reseed for LFSR and cut off test sequence of the low fault coverage effectively. The seed can generation fixed length pseudo-random test sequence, the sequence reduce test time and number of test vectors mostly. Experimental results that this technique can reduce the length of vectors, shorten test time and low power consumption based on without reduce the fault coverage

APA, Harvard, Vancouver, ISO, and other styles

37

LUO, Song-jiang, Shui-sheng QIU, and Kai-qing LUO. "New chaotic pseudo-random sequence and its performance analysis." Journal of Computer Applications 28, no. 12 (2009): 3187–89. http://dx.doi.org/10.3724/sp.j.1087.2008.03187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

CHEN, Shuai, and Xian-xin ZHONG. "Chaotic block iterating method for pseudo-random sequence generator." Journal of China Universities of Posts and Telecommunications 14, no. 1 (2007): 45–48. http://dx.doi.org/10.1016/s1005-8885(07)60054-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Sun, Fuyan, and Shutang Liu. "Cryptographic pseudo-random sequence from the spatial chaotic map." Chaos, Solitons & Fractals 41, no. 5 (2009): 2216–19. http://dx.doi.org/10.1016/j.chaos.2008.08.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Amrani, M. E. H., R. M. Dowdeswell, P. A. Payne, and K. C. Persaud. "Pseudo-random binary sequence interrogation technique for gas sensors." Sensors and Actuators B: Chemical 47, no. 1-3 (1998): 118–24. http://dx.doi.org/10.1016/s0925-4005(98)00013-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Pelishok, V., Yu Pyrih, and R. Burachok. "OPTIMIZATION OF GOLD'S PSEUDO-RANDOM SEQUENCES IN COMMUNICATION SYSTEMS." Information and communication technologies, electronic engineering 3, no. 1 (2023): 64–72. http://dx.doi.org/10.23939/ictee2023.01.064.

Full text

Abstract:

The article considers the method of optimization of Gold’s pseudo-random sequences for communication systems. At the same time, the peculiarity of the generation of the specified sequences is taken into account, namely that they can be generated only with a specific maximum number N (for example, 9, 33, 65, etc.). But in practice, there are often cases when a much smaller number of them is needed, i.e. there are excess PVPs. The problem arises, which sequences are more appropriate to choose as redundant, if they are not equivalent. The analysis of the structure of correlation functions, both p

APA, Harvard, Vancouver, ISO, and other styles

42

Song, Xijin, Xuelong Wang, Zhao Dong, Xiaojiao Zhao, and Xudong Feng. "Analysis of Pseudo-Random Sequence Correlation Identification Parameters and Anti-Noise Performance." Energies 11, no. 10 (2018): 2586. http://dx.doi.org/10.3390/en11102586.

Full text

Abstract:

Using a pseudo-random sequence to encode the transmitted waveform can significantly improve the working efficiency and depth of detection of electromagnetic exploration. The selection of parameters of pseudo-random sequence plays an important role in correlation identification and noise suppression. A discrete cycle correlation identification method for extracting the earth impulse response is proposed. It can suppress the distortion in the early stage of the excitation field and the glitches of the cross correlation function by traditional method. This effectively improves the accuracy of cor

APA, Harvard, Vancouver, ISO, and other styles

43

Niemkova, Olena, and Mykhailo Kikh. "COMPARATIVE STUDY OF TESTS FOR ASSESSMENT OF STATISTICAL CHARACTERISTICS OF RANDOM AND PSEUDO-RANDOM SEQUENCE GENERATORS." Cybersecurity: Education, Science, Technique 4, no. 24 (2024): 115–32. http://dx.doi.org/10.28925/2663-4023.2024.24.115132.

Full text

Abstract:

In the world of information security, computer science and cryptography, the issue of statistical security of generated sequences is very important. Statistical sequence security plays an important role in the following fields: cryptography, computer security, system modeling, statistical analysis, and information security in networks. This article is devoted to the study and comparison of test sets for evaluating the statistical properties of random and pseudorandom sequence generators. The comparison focuses on well-known test suites such as NIST, DieHard, and TestU01. These tests were selec

APA, Harvard, Vancouver, ISO, and other styles

44

Liu, Haiqiang, Ming Li, and Caiping Hu. "Construction of Flexible Deterministic Sparse Measurement Matrix in Compressed Sensing Using Legendre Sequences." Sensors 24, no. 22 (2024): 7406. http://dx.doi.org/10.3390/s24227406.

Full text

Abstract:

Compressed sensing (CS) is an innovative signal acquisition and reconstruction technology that has broken through the limit of the Nyquist sampling theory. It is widely employed to optimize the measurement processes in various applications. One of the core challenges of CS is the construction of a measurement matrix. However, traditional random measurement matrices are often impractical. Additionally, many existing deterministic binary measurement matrices fail to provide the required flexibility for practical applications. In this study, inspired by the observation that pseudo-random sequence

APA, Harvard, Vancouver, ISO, and other styles

45

Belyaev, Sergey, Marina Budko, Mikhail Budko, Alexei Guirik, and Vladimir Grozov. "Development of a Pseudo-Random Sequence Generation Function Based on the “Kuznechik” Cryptographic Algorithm." Voprosy kiberbezopasnosti, no. 4(44) (2021): 25–34. http://dx.doi.org/10.21681/2311-3456-2021-4-25-34.

Full text

Abstract:

Purpose: increasing the cryptographic strength level of the pseudo-random sequence generation function based on the «Kuznechik» encryption algorithm. Research methods: methods for constructing pseudo-random sequence generators using a strong cryptographic algorithm as a generation function in accordance with the recommendations of NIST SP 800-90. Methods of probability theory and mathematical statistics (statistical hypothesis testing, Pearson’s criterion), methods for estimating the entropy of a random process. Results: а method for development of the main component of the deterministic gener

APA, Harvard, Vancouver, ISO, and other styles

46

N, Bharatesh, and Rohith S. "FPGA Implementation of Park-Miller Algorithm to Generate Sequence of 32-Bit Pseudo Random Key for Encryption and Decryption of Plain Text." International Journal of Reconfigurable and Embedded Systems (IJRES) 2, no. 3 (2013): 99. http://dx.doi.org/10.11591/ijres.v2.i3.pp99-105.

Full text

Abstract:

There are many problems arises in randomized algorithms whose solutions are fundamentally based on assumptions that pure random numbers exist, so pseudo-random number generators can imitate randomness sufficiently well for most applications. The proposed scheme is a FPGA implementation of Park-Miller Algorithm for generating sequence of Pseudo-Random keys. The properties like High speed, low power and flexibility of designed PRNG(Pseudo Random Number Generator) makes any digital circuit faster and smaller. The algorithm uses a PRNG Module, it contains 32-bit Booth Multiplier, 32-bit Floating p

APA, Harvard, Vancouver, ISO, and other styles

47

Корольов, Р. В., А. М. Ткачов, Н. І. Воропай, М. Мамедов, and Е. Багіров. "Development of an improved method for forming pseudorandom numbers based on redunte M-ary codes." Системи обробки інформації, no. 1 (168) (February 10, 2022): 29–35. http://dx.doi.org/10.30748/soi.2022.168.03.

Full text

Abstract:

The development of information technologies in cyberspace is associated with the development of security services in the components of security: cybersecurity, information security and information security. To provide security services, as a rule, cryptographic algorithms and functions based on symmetric and asymmetric cryptography systems are used. An integral part of such cryptosystems are pseudo-random number generators that allow you to generate a random sequence over a period. One of the evaluation criteria is the duration of the period and its guarantee, i.e. ensuring the randomness prod

APA, Harvard, Vancouver, ISO, and other styles

48

Wang, Zuxi, Siyang Wang, Zhong Chen, and Boyun Zhou. "A Novel Parameter-Variabled and Coupled Chaotic System and Its Application in Image Encryption with Plaintext-Related Key Concealment." Entropy 26, no. 10 (2024): 832. http://dx.doi.org/10.3390/e26100832.

Full text

Abstract:

The design of a chaotic system and pseudo-random sequence generation method with excellent performance and its application in image encryption have always been attractive and challenging research fields. In this paper, a new model of parameter-variabled coupled chaotic system (PVCCS) is established by interaction coupling between parameters and states of multiple low-dimensional chaotic systems, and a new way to construct more complex hyperchaotic systems from simple low-dimensional systems is obtained. At the same time, based on this model and dynamical DNA codings and operations, a new pseud

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Xianxiang, Juzhi Deng, and Jingli Ren. "Selection of code width and analysis of influencing factors in multitransient electromagnetic method." Geophysical Journal International 220, no. 1 (2019): 160–73. http://dx.doi.org/10.1093/gji/ggz436.

Full text

Abstract:

SUMMARY The multitransient electromagnetic method (MTEM) uses an m pseudo-random binary sequence (PRBS) as the source waveform, which requires deconvolution to recover the impulse response. To obtain high-precision impulse responses, the frequency bandwidth of a pseudo-random sequence should be consistent with the identified system. Code width is an important parameter of an m pseudo-random sequence which determines the maximum frequency bandwidth of an m pseudo-random sequence. If the code width is too wide, the signal-to-noise ratio of the high-frequency section cannot be guaranteed; if it i

APA, Harvard, Vancouver, ISO, and other styles

50

Zhang, Jing, and San Cai Li. "Blind Source Separation Method Based on Pseudo-Random Code." Applied Mechanics and Materials 135-136 (October 2011): 336–40. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.336.

Full text

Abstract:

According to pseudo noise communication and related characteristics of pseudo-random code, this paper proposed a blind source separation method. The method can separate the different pseudo-code sequence from the pseudo-code wide frequency signal. The method can quickly and accurately isolate and identify the pseudo–code feature of different user, to get the user’s voice or data information, which has good application prospects.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!