Abstarct— The field of pseudo random number generation is important as well as not much explored. In present manuscript, we explores the possibility of a new Pseudorandom Random Number Generator and gives its testing results on NIST test battery.
Keyword— Random Number Generator, NIST statistical test suite, SIGMA
I. INTRODUCTION
A pseudo-random bit sequence is an output of any deterministic algorithm, which generates a wide number of pseudo-random bits that every set of bits has an equal chance of being chosen from the universe of numbers [1]. To generate these pseudo random bits, pseudo random number generators PRBGs are used, to which, seed of length n is feed as input and the resulting output of length l(n), with l(n) >> n is called pseudo random sequence.
Pseudo-random numbers are widely used for simulation, numerical analysis, testing of programs and hardware using random data, decision making in lotteries and games and cryptography [2]. A good PRNG must possess several of qualities such as unpredictability, large period length, uniform distribution, efficiency, portability, repeatability, and a good structure.
II. SIGMA: THE PROPOSED ALGORITHM
The current section illustrates propose algorithm for generating pseudorandom bits named SIGMA. The reason behind naming the algorithm as SIGMA is that it uses summation or sigma (∑) to compute the random numbers. The algorithm proposed in this text exhibits good statistical properties while tested on NIST (National Institute of Standards and Technology) statistical test suit specified in NIST Special Publication 800-22 [3], and hence fit itself to provide source of randomness in almost every non-cryptographic application such as simulation, testing, gaming, randomized algorithm,...
... middle of paper ...
...nuth, The art of ComputerProgramming: Semi Emperical algorithms, Addison Wesley, 1998, Reading, USA.
[6] H. Gustafson, E. Dawson,L. Nielsen, W. Caelli, “A computer package for measuring the strength of encryption algorithms”, J. Computer Security, vol. 13 (1994), pp. 687-697.
[7] J. Soto, Statistical testing of random number generators, Proc. of 22nd National Information System Security Conference http://csrc.nist.gov/groups/ST/toolkit/rng/documents/nissc-paper.pdf
[8] M. Haahr, S. Haahr, Random.org, http://random.org , last accessed on July 26, 2013.
[9] GCC, the GNU Compiler Collection, http://gcc.gnu.org/ , last accessed on July 26, 2013.
[10] The GNU Multiple Precision Arithmetic Library, http://gmplib.org/ , last accessed on July 26, 2013.
[11] Matlab: The Language of Technical Computing, http://www.mathworks.in/products/matlab/, last accessed on July 26, 2013.
Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 151--160, New York, May 23--26
New bitcoin are created by the intensive user task called “mining.” A miner solves mathematical algorithms w...
This program uses mainly on the concept of cryptology. Cryptology is the study about secret communication between two parties, where there is a presence of a third party known as adversaries, and that party knows nothing about the content of the communication (Rivest, 1990).
PKC is the enabling technology for all Internet security and the increasing use of digital signatures, which are replacing traditional signatures in many contexts. However, RSA is better than PKC because RSA doesn’t need digital signature. As a result, the RSA algorithm turned out to be a perfect fit for the implementation of a practical public security system. In 1977, Martin Gardner first introduced the RSA system. After 5 years, company RSA used secure electronic security products. Nowadays many credit companies of all over the world use the RSA system or a similar system based on the RSA system.
... that the encoding system by W. K. Wong, D. W. Cheung, E. Hung, B. Kao, and N. Mamoulis in [24] can be broken without using context-specific information. The success of the attacks in [25] mainly relies on the existence of unique, common, and fake items, defined by W. K. Wong, D. W. Cheung, E. Hung, B. Kao, and N. Mamoulis in [24]; our scheme does not create any such items, and the attacks by Y. Lindell and B. Pinkas in [5] are not applicable to our scheme. Tai et al. [9] assumed the attacker knows exact frequency of single items, similarly to us.
Random checks are performed at regular intervals to check for user activity. When any of the users is found breaking security code, an immediate action is taken to notify user about violation.
event such as a sequence of numbers as produced by a random event generator. The
Introduction to the basic concepts of probability and statistics with discussion of applications to computer science.
Digital Privacy." http://rescomp.stanford.edu/~pweston/privacy.html. December 1995. Froomkin, A. Michael. "The Metaphor is the Key: Cryptography, The Clipper Chip, and the Constitution."
Lv, X., Li, H., Wang, B. (2012) Virtual private key generator based escrow-free certificateless public key cryptosystem for mobile ad hoc networks ISSN: 19390114
[15] T. J. Klevinsky, Scott Laliberte, and Ajay Gupta. (2002). Hack I.T.: Security Through Penetration Testing. Addison-Wesley Professional.
My knowledge has grown over the past six years, outwith the areas of learning offered by school courses, and I see this course as an opportunity to gain new skills and broaden my knowledge further. My main interests are varied, including communications and the internet, system analysis and design, software development, processors and low level machine studies. I have recently developed an interest in data encryption, hence my active participation in the RSA RC64 Secret-Key challenge, the latest international de-encryption contest from the RSA laboratories of America.
because 3 × 25 = 75 and 85 - 75 = 10. However this method of random
Melford, RJ 1993, 'Network security ', The Internal Auditor, vol. 50, no. 1, p. 18.
Did your phone just ring? Or was that your computer notifying you of a new email? Since the Digital Revolution and the addition of digital electronics like the personal computer, software-based technology has always been an essential aspect of our lives. Something that would have taken up an entire classroom can now fit within the grasp of your hands thanks to the efforts of various computer scientists and engineers, making our lives much easier.