Deterministic Random Number Generators for Online Applications
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32797
Deterministic Random Number Generators for Online Applications

Authors: Natarajan Vijayarangan, Prasanna S. Bidare

Abstract:

Cryptography, Image watermarking and E-banking are filled with apparent oxymora and paradoxes. Random sequences are used as keys to encrypt information to be used as watermark during embedding the watermark and also to extract the watermark during detection. Also, the keys are very much utilized for 24x7x365 banking operations. Therefore a deterministic random sequence is very much useful for online applications. In order to obtain the same random sequence, we need to supply the same seed to the generator. Many researchers have used Deterministic Random Number Generators (DRNGs) for cryptographic applications and Pseudo Noise Random sequences (PNs) for watermarking. Even though, there are some weaknesses in PN due to attacks, the research community used it mostly in digital watermarking. On the other hand, DRNGs have not been widely used in online watermarking due to its computational complexity and non-robustness. Therefore, we have invented a new design of generating DRNG using Pi-series to make it useful for online Cryptographic, Digital watermarking and Banking applications.

Keywords: E-tokens, LFSR, non-linear, Pi series, pseudo random number.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1087524

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1960

References:


[1] Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, 2001.
[2] Beckmann, P. A History of Pi, 3rd ed. New York: Dorset Press, 1989.
[3] Berndt, B. C. Ramanujan's Notebooks, Part IV.New York: Springer- Verlag, 1994.
[4] Douglas Stinson, Theory and Practice:Cryptography, CRC Press 2002.
[5] George Marsaglia, On the randomness of Pi and other decimal expansions, InterStat, #5, October,2005.
[6] Henry S. Warren, Jr, Hackers Delight, Addison-Wesley, 2002.
[7] John Walker, ENT, A pseudorandom Number Sequence Test Program.http://www.fourmilab.ch/random/
[8] Michael Arnold, Martin Schmucker, Stephen D. Wolthusen, Techniques and applications of Digital Watermarking and Content Protection, Artech House Inc, 2003.
[9] NIST special publication 800-22 (2001): A statistical test suite for random and pseudorandom number generators for cryptographic applications, National Institute of Standards and Technology. http://csrc.nist.gov/groups/ST/toolkit/rng/documents/SP800-22b.pdf.
[10] Rafael C. Gonzalez, Richard E.Woods, Steven L. Eddins, Digital Image Processing Using MATLAB, Pearson Education Inc, 2007.
[11] Vijayarangan N. and Kasilingam S., Random number generation using primitive polynomials, Proceedings of SSCCII-2004,Italy.
[12] Vijayarangan N. and Vijayasarathy R., Primitive polynomials testing methodology, Jour. of Discrete Mathematics & Cryptography, Vol.8, No.3, pp. 427-435, 2005.
[13] Vijayarangan N. and Srinivasa Rao C., Deterministic random number generator for cryptography and digital watermarking, USPTO 20090193065.
[14] Shu-Ju Tu and Ephraim Fischbach, A study on the randomness of Pi, International Journal of Modern Physics C, 16, No. 2, 281–294, 2005.