A new method for generating key for cryptography using Deterministic random number generator
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2013 by IJETT Journal|
|Year of Publication : 2013|
|Authors : P PAVAN KUMAR , J MADAN KUMAR , M NEELIMA|
P PAVAN KUMAR , J MADAN KUMAR , M NEELIMA. "A new method for generating key for cryptography using Deterministic random number generator". International Journal of Engineering Trends and Technology (IJETT). V4(9):3915-3920 Sep 2013. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group.
Now a day’s communication has played a key role in each and every aspect of life. In communication the main problem is security and privacy of sensitive data. The data should be transmitted from sender to re ceiver without any loss of original information. There are many ways of secure communication. One of those techniques is Cryptography. In cryptography there are mainly two mechanisms. They are Encryption and Decryption. In Encryption the sender will conve rt the original message called plain text into cipher text which is unreadable. Encryption needs encryption key. This cipher text will be send through communication channel to receiver. The receiver needs to decrypt the cipher text into plain text by using decryption key. Here key plays main role. The security of the encrypted message depends on key (encryption and decryption keys, in symmetric encryption both keys are same). The key should be unpredictable, random, and nonlinear and hardware cost for gener ating key should be less. There are many ways to generate random keys. In this paper we are proposing a technique called Reseeding mixing Pseudo Random number generator simply RM - PRNG. Advantages of this RM - PRNG are low hardware cost, non linearity, and h igh throughput. This technique can be used in digital electronics & embedded testing, debugging, stimulation of digital signal processing hardware and digital to analog converters stimulations.
. Chung - Yi Li, Yuan - Ho Chen, Tsin - Yuan Chang, Lih - Yuan Deng and Kiwing To, “Period Extension and Randomness Enhancement Using High - Throughput Reseeding - Mixing PRNG” transactions on (vlsi) systems, vol. 20, no. 2, february 2
. T. Sang, R. Wang, and Y. Yan, “Clo ck - controlled chaotic keystream generators,” Electron. Lett., vol. 34, no. 20, pp. 1932 – 1934, Oct. 1998.
. D. Mukhopa dhyay, “Group pr operties of non - linear cellular automata,” J. Cellular Autom., vol. 5, no. 1, pp. 139 – 155, Oct. 2009.
. D. Mukhopadhyay,D. R. Chowdh ury, and C. Rebeiro, “Theory of composing non - linear machines with predictable cyclic structures,” in Proc. 8th Int. Conf. Cellular Autom. Res. Ind., 2008, pp. 210 219, Springer.
. J. E. Gentle, Random Nu mber Generation and Monte Carlo Methods,2nd ed. New York: Springer - Verlag, 2003.
. D. Knuth, The Art of Computer Programming, 2nd ed. Reading, MA : Addison - Wesley, 1981.
. Klapper and M. Goresky, “Feedback shift registers, 2 - adic span, and combiners with memory,” J. Cryptology, vol. 10, pp. 111 – 147, 1997.
. D. H. Lehmer, “Mathematical m ethods in large - scale computing units,” in Proc. 2nd Symp. Large Scale Digital Comput. Machinery, Cambridge, MA, 1951, pp. 141 – 146, Harvard Univ. Press.
. S. Li, X. Mou, and Y. Cai, “Pseudo - random bit generator based on couple chaotic systems and its application in stream - ciphers cryptography,” in Prog r. Cryptol. - INDOCRYPT, 2001, vol. 2 247, pp. 316 – 329, Lecture Notes Comput. Sci.
PRNG - pseudo random number generator, LFSR - linear feedback shift registers , LCG - linear congruential generators , MRG - multiple recursive generator , RCU - reseeding control unit , RC - reseeding counter , ALG - auxiliary linear generator , PG - propagation and generation , EAC - end - around - carry , IC - internal carry , CLA - carry look ahead adder .