Academic literature on the topic 'Psedo-Random Bit Generator PRBG'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Psedo-Random Bit Generator PRBG.'

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.

Journal articles on the topic "Psedo-Random Bit Generator PRBG"

1

LI, PING, ZHONG LI, WOLFGANG A. HALANG, and GUANRONG CHEN. "ANALYSIS OF A MULTIPLE-OUTPUT PSEUDO-RANDOM-BIT GENERATOR BASED ON A SPATIOTEMPORAL CHAOTIC SYSTEM." International Journal of Bifurcation and Chaos 16, no. 10 (2006): 2949–63. http://dx.doi.org/10.1142/s0218127406016574.

Full text
Abstract:
A novel multiple-output pseudo-random-bit generator (PRBG) based on a coupled map lattice (CML) consisting of skew tent maps, which generates spatiotemporal chaos, is presented. In order to guarantee PRBG highly effective, avoiding synchronization among the sites in the CML is discussed. The cryptographic properties, such as probability distribution, auto-correlation and cross-correlation, of the PRBG with various parameters, are investigated numerically. The randomness of the PRBG is verified via FIPS 140-2. In addition, as compared with the PRBG based on the CML consisting of the logistic maps, which are often used in chaos-based PRBGs by many other researchers, the ranges of the parameters within which this multiple-output PRBG have good cryptographic properties are much bigger in terms of their cryptographic properties. It lays a foundation for designing a faster and more secure encryption.
APA, Harvard, Vancouver, ISO, and other styles
2

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 generator (PRBG). The result shows that the code sequences generated by the proposed PRBG have great auto- and cross-correlation properties, which are very similar to the PRN sequences used by GPS navigation system. The RPBG sequences are therefore suitable for signal ranging that is used comprehensively in the navigation system. On the other hand, the chaotic nature of the proposed PRBG codes can provide more secure communication than the traditional PRN sequences. The proposed PRN sequences are well suitable to be incorporated with the so-called chaotic shift keying (CSK) modulation.
APA, Harvard, Vancouver, ISO, and other styles
3

García-Martínez, M., and E. Campos-Cantón. "Pseudo-random bit generator based on lag time series." International Journal of Modern Physics C 25, no. 04 (2014): 1350105. http://dx.doi.org/10.1142/s0129183113501052.

Full text
Abstract:
In this paper, we present a pseudo-random bit generator (PRBG) based on two lag time series of the logistic map using positive and negative values in the bifurcation parameter. In order to hidden the map used to build the pseudo-random series we have used a delay in the generation of time series. These new series when they are mapped xn against xn+1 present a cloud of points unrelated to the logistic map. Finally, the pseudo-random sequences have been tested with the suite of NIST giving satisfactory results for use in stream ciphers.
APA, Harvard, Vancouver, ISO, and other styles
4

Fadhil, Sahib Hasan, and Amer Saffo Maryam. "FPGA Hardware Co-Simulation of Image Encryption using Hybrid Chaotic Maps Based Stream Cipher." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 4 (2020): 215–25. https://doi.org/10.35940/ijeat.D6713.049420.

Full text
Abstract:
In This paper, new model of image encryption is designed. This model using stream cipher based on finite precision chaotic maps. The model designed in efficient way by using Xilinx System Generator (XSG). Pseudo Random Bit Generator (PRBG) depends on chaotic maps is proposed to design Fixed Point Hybrid Chaotic Map-PRBG (FPHYBCM-PRBG). National Institute of Standards and Technology (NIST) randomness measures tested the randomness of the proposed FPHYBCM-PRBG system. The security analysis, such as histogram, correlation coefficient, information entropy, differential attack (NPCR and UACI) are used to analyze the proposed system. Also, FPGA Hardware Co-Simulation over Xilinx SP605 XC6SLX45T provided to test the reality of image encryption system. The results show that FPHYBCM-PRBG is suitable for image encryption based on stream cipher and outperform some encryption algorithms in sufficient way to enhance the security and robust against brute force attack with low maximum frequency and throughput.
APA, Harvard, Vancouver, ISO, and other styles
5

Qiu, Jin, and Ping Wang. "Color Image Encryption Scheme Based on Chaotic Map." Applied Mechanics and Materials 182-183 (June 2012): 1800–1804. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.1800.

Full text
Abstract:
In this paper, a chaos-based image encryption scheme with stream cipher structure is proposed. The key component of the encryption system is a pseudo-random bit generator (PRBG) based on a chaotic map and a linear feedback shift register. The proposed PRBG is not only passes the statistical tests, but also improve the security. The overall design of the image encryption scheme is to be explained while detail cryptanalysis is given.
APA, Harvard, Vancouver, ISO, and other styles
6

WANG, XINGYUAN, WEI LIU, NINI GU, and HUAGUANG ZHANG. "DIGITAL STREAM CIPHER BASED ON SCS-PRBG." International Journal of Modern Physics B 23, no. 25 (2009): 5085–92. http://dx.doi.org/10.1142/s0217979209053539.

Full text
Abstract:
Limitations caused by degeneration of dynamics characteristics may exist in the traditional single chaotic system. The authors propose a method i.e., switch controller chaos and pseudo random bit generator (it is called SCS-PRBG for short), which is based on multiple chaotic systems and switch control. By the theoretic analysis of random key stream and performance of SCS-PRBG, we can see that its digital stream cipher has better randomicity and security. And if using hardware parallel computation, the speed of encryption can be improved sharply. The results of the experiments also present better security of this arithmetic.
APA, Harvard, Vancouver, ISO, and other styles
7

H, Soumya Babu, and Gopakumar K. "ELECTRONIC CIRCUIT REALISATION OF A CHAOTIC PSEUDO RANDOM BIT GENERATOR." ICTACT Journal on Microelectronics 7, no. 2 (2021): 1121–26. https://doi.org/10.21917/ijme.2021.0195.

Full text
Abstract:
Most of the properties of chaotic systems like sensitivity to initial conditions, deterministic dynamics, mixing property, structural complexity can be considered as analogous to diffusion and confusion with small changes in plain text or the secret key, deterministic pseudo randomness and complex properties of cryptographic systems. The interesting relationship between cryptography and chaos leads to new, highly secure cryptographic techniques. The development of chaotic stream ciphers in cryptography requires the need for the generation of pseudo random bits and hence the need for pseudo random bit generators (PRBG). In this paper, circuit realisation of a pseudo random bit generator is presented, which is based on two chaotic maps, namely the logistic maps, running in parallel and starting from two random independent initial conditions. The circuit is being implemented and simulated for different initial conditions using Multisim software. The results obtained from simulation are further tested for randomness using the NIST suite tests and the detailed results of the statistical testing are also presented in this paper.
APA, Harvard, Vancouver, ISO, and other styles
8

Ahmed, Kamil Hasan Al-Ali, and Mohammed Daif Alkhasraji Jafaar. "Colour image encryption based on hybrid bit-level scrambling, ciphering, and public key cryptography." Bulletin of Electrical Engineering and Informatics 12, no. 3 (2023): 1607~1619. https://doi.org/10.11591/eei.v12i3.4728.

Full text
Abstract:
This paper proposes an image encryption technique using three stages algorithms based on hyper-chaotic maps. In the first scenario, bit-level scrambling (BLS) using a 2D coupled chaotic map (2D-CCM) is used to encrypt the bits of the basic colour image. In the second strategy, the scrambled bit level is XORed with pseudo random bit generator (PRBG). The PRBG is designed using a combination of chaotic maps, including, logistic map (LM), sine map (SM), 5D chaotic map (5D-CM), enhanced quadratic map (EQM), and 2D henon SM (2D-HSM). The pubic key based on the Chebyshev polynomial chaotic map is used as the final phase of the encryption algorithms. The performance analysis of the proposed image encryption technique is validated through various criteria such as fundamental space analysis, correlation coefficient, entropy, the number of pixels changes rate (NPCR), and unified average-changing intensity (UACI). Also, the obtained results are compared with other recent studies. The simulation results demonstrated that the proposed technique has robust security and it provides the image with high protection against various attacks.
APA, Harvard, Vancouver, ISO, and other styles
9

Abdulla, M. Abuayyash, and Ajlouni Naim. "Using Permutations to Enhance the Gain of RUQB Technique." International Journal of Information Technology and Web Engineering, April-Jun (April 1, 2018): 30–45. https://doi.org/10.5281/zenodo.1210768.

Full text
Abstract:
&nbsp; <em>Quantum key distribution (QKD) techniques usually suffer from a gain problem when comparing the final key to the generated pulses of quantum states. This research permutes the sets that RUQB (Abu-ayyash &amp; Ajlouni, 2008) uses in order to increase the gain. The effect of both randomness and permutations are studied; While RUQB technique improves the gain of BB84 QKD by 5.5% it was also shown that the higher the randomness of the initial key the higher the gain that can be achieved, this work concluded that the use of around 7 permutations results in 30% gain recovery in an ideal situations. </em>
APA, Harvard, Vancouver, ISO, and other styles
10

Al-Ali, Ahmed Kamil Hasan, and Jafaar Mohammed Daif Alkhasraji. "Colour image encryption based on hybrid bit-level scrambling, ciphering, and public key cryptography." Bulletin of Electrical Engineering and Informatics 12, no. 3 (2023): 1607–19. http://dx.doi.org/10.11591/eei.v12i3.4728.

Full text
Abstract:
This paper proposes an image encryption technique using three stages algorithms based on hyper-chaotic maps. In the first scenario, bit-level scrambling (BLS) using a 2D coupled chaotic map (2D-CCM) is used to encrypt the bits of the basic colour image. In the second strategy, the scrambled bit level is XORed with pseudo random bit generator (PRBG). The PRBG is designed using a combination of chaotic maps, including, logistic map (LM), sine map (SM), 5D chaotic map (5D-CM), enhanced quadratic map (EQM), and 2D henon SM (2D-HSM). The pubic key based on the Chebyshev polynomial chaotic map is used as the final phase of the encryption algorithms. The performance analysis of the proposed image encryption technique is validated through various criteria such as fundamental space analysis, correlation coefficient, entropy, the number of pixels changes rate (NPCR), and unified average-changing intensity (UACI). Also, the obtained results are compared with other recent studies. The simulation results demonstrated that the proposed technique has robust security and it provides the image with high protection against various attacks.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Psedo-Random Bit Generator PRBG"

1

Jain, Deepak, Ashwani kumar, and C. D. D Guruprakash. "IMPLEMENTATION OF AN EFFICIENT PSEUDORANDOM BIT GENERATION METHOD AND ITS VLSI ARCHITECTURE." In 9th National Conference & Exhibition on Emerging and Innovative Trends in Engineering Technology (NCEEITET). IARS' Press Australia, 2023. https://doi.org/10.62431/wr0x0956.

Full text
Abstract:
Hence, data security has become a top priority. Cryptographic methods help resource-constrained smart devices encrypt and decrypt data. This protects data. PRBGs generate pseudo-random binary sequences from seeds. The cryptographic method's essential building element assures data secrecy. Academic research has used PRBG methods to generate pseudorandom bit sequences. Blum-Blum-Shub (BBS) PRBG is unexpected and cryptographically safe. BBS implementation requires huge integer modular multiplication. This makes the process computationally slow or costly. Han-Carlson adders and Montgomery modular multiplication are proposed for a low-latency BBS design. This will significantly reduce crucial route and computational delay. While improving the critical path, this technique has O(2n) clock delay due to recurrent calculation. This constraint necessitates research on a low hardware complexity coupled-LCG (CLCG) approach. CLCG uses a smaller region, reduced latency, and longer durations than BBS. Nevertheless, it fails the spectrum test, which can be rectified by dual-coupling four LCGs. The dual-CLCG approach requires inequality equations to obtain a valid one-bit random outcome. Inequality equations govern this procedure. Inequality equations slow the hardware implementation of the dual-CLCG approach for pseudorandom bit generation at every uniform clock rate. The thesis proposes a memory-based dual-CLCG architecture to solve this challenge. This architecture creates pseudorandom bits periodically. Its drawbacks include a high beginning clock delay, needless memory use, and a shorter sequence duration than other algorithms. This thesis presents two new PRBG algorithms and VLSI designs to solve these problems. These approaches create a pseudorandom bit every clock cycle with simple electronics. Both methods achieve the maximum length sequence and consistently pass all fifteen NIST benchmark tests. The recommended designs are built using Verilog HDL and prototyped using a commercial FPGA device in a lab. PRBG algorithms may assist produce pseudorandom bits in hardware security applications.
APA, Harvard, Vancouver, ISO, and other styles
2

Mandal Kalikinkar, Fan Xinxin, and Gong Guang. "Warbler: A Lightweight Pseudorandom Number Generator for EPC C1 Gen2 Tags." In Cryptology and Information Security Series. IOS Press, 2012. https://doi.org/10.3233/978-1-61499-143-4-73.

Full text
Abstract:
A pseudorandom number generator is an important component for implementing security functionalities on RFID tags. Most previous proposals focus on true random number generators that are usually inefficient for low-cost tags in terms of power consumption, area, and throughput. In this contribution, we propose a lightweight pseudorandom number generator (PRNG) for EPC Class-1 Generation-2 (EPC C1 Gen2) RFID tags. The proposed PRNG fully exploits nonlinear feedback shift registers and provides 16-bit random numbers that are required in the tag identification protocol of the EPC C1 Gen2 standard. The generated sequences are able to pass the EPC C1 Gen2 standard's statistical tests as well as the NIST randomness test suite. Moreover, a detailed cryptanalysis shows that the proposed PRNG is resistant to the most common attacks such as algebraic attacks, cube attacks, and time-memory-data tradeoff attacks. In particular, the proposed PRNG can be implemented on low-cost Xilinx Spartan-3 FPGA devices with 46 slices.
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!