An Efficient Pseudo Random Number Generator for Cryptographic Applications
K. Chandra Sekhar1, K. Saritha Raj2
1K. Chandra Sekhar, Dept. of Electronics and Communication, MVGR College of Engineering, Vizianagaram, India.
2Mrs. K. Saritha Raj, Dept. of Electronics and Communication, MVGR College of Engineering, Vizianagaram, India.
Manuscript received on September 20, 2014. | Revised Manuscript received on October 11, 2014. | Manuscript published on October 30, 2014. | PP: 167-170 | Volume-4 Issue-1, October 2014. | Retrieval Number: A3511104114/2013©BEIESP
Open Access | Ethics and Policies | Cite
© 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: LFSR based Pseudo Random Sequence Generator (PRSG) technique is used for various cryptography applications such as Data Encryption keys, Bank Security communication channels etc. The total number of Random States generated using LFSR are 2n -1 and depends on the Feedback Polynomial used in the design. Linear Feedback Shift Register(LFSR) counter is very effective when compared to other counters used in cryptographic applications especially in terms of Hardware, speed of operation and it is also less prone to Glitches. In this paper we implemented LFSR counter and it is compared with Binary and Gray counters to observe the performance of the counter in terms of Hardware and Speed. The analysis is conceded out to find number of gates, Memory and Speed requirement as the number of bits gets increased.
Keywords: LFSR, Pseudo Random Sequence Generator, Feedback Polynomial.