Loading

Design of Pseudo Random Number Generator using Linear Feedback Shift Register
Shabbir Hassan1, M. U. Bokhari2

1Shabbir Hassan, Department of Computer Science, Aligarh Muslim University Aligarh, India.
2Prof. M. U. Bokhari, Department of Computer Science, Aligarh Muslim University Aligarh, India.
Manuscript received on November 22, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 1956-1965 | Volume-9 Issue-2, December, 2019. | Retrieval Number:  B2912129219/2019©BEIESP | DOI: 10.35940/ijeat.B2912.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Nowadays security has become a great concern in the field of computer science and information technology. In order to protect data from unintended users and to achieve a desirable level of security, several cryptographic algorithms based on various technology have been proposed. Linear Feedback Shift Register (LFSR) may play an important role in the design of such cryptographic algorithms. LFSR based cryptographic algorithms are often lightweight in nature and are more suitable for resource constraining devices. In this paper we present a detailed analysis of LFSR and design of LFSR to implement cryptographic algorithms.
Keywords: Q Array PRNG, FSR, Modular Arithmetic, Galois Field , Primitive Polynomial , Primitive Polynomial over , LFSR, , Run Length, Linear Recurrence, NIST.