We investigate characteristics of random split trees introduced by Devroye [SIAM J Comput 28, 409–432, 1998]; split trees include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k + 1)-trees, simplex trees, tries and digital search trees. More precisely: We use renewal theory in the studies of split trees, and use this theory to prove several results about split trees. A s...

................................................. v 1 . INTRODUCTION ........................................... 1 2 . PSEUDO RANDOM NUMBER GENERATION .................... 3 3 . APPLICATION TO THE KEY MANAGEMENT PROBLEM . . . . . . . . . . 7 4 . IMPLEMENTATION ........................................ 11 5 . DISCUSSION .............................................. 13 REFERENCES ...................

Typically, traditional inventory models operate under the assumption of perfect quality. In this paper we modify an inventory model with finite-range stochastic lead time to allow for a random number of defective units in a lot. However, there is an extra cost for holding the defective items in the lot for the period before it is returned to the supplier. This paper also considers the option of...

This paper develops an efficient pseudo-random number generator for validation of digital communication channels and secure disc. Drives. Simulation results validates the effectiveness of the random number generator.

This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.

A pseudo-random number generator (RNG) might be used to generate w-bit random samples in d dimensions if the number of state bits is at least dw. Some RNGs perform better than others and the concept of equidistribution has been introduced in the literature in order to rank different RNGs. We define what it means for a RNG to be (d,w)-equidistributed, and then argue that (d,w)-equidistribution i...

This paper presents an algorithm for generating pseudorandom numbers using quasigroups. Random numbers have several applications in the area of secure communication. The proposed algorithm uses a matrix of size n x n which is pre-generated and stored. The quality of random numbers generated is compared with other pseudorandom number generator using Marsaglia’s Diehard battery of tests.

In their paper “A Quasigroup Based Random Number Generator for Resource Constrained Environments”, the authors Matthew Battey and Abhishek Parakh propose the pseudo random number generator LOQG PRNG 256. We show several highly efficient attacks on LOQG PRNG 256.

Kim et al (Appl Math & Comput 199 (2008) 195) recently presented a test of random number generators based on the gambler’s ruin problem and concluded that several generators, including the widely used Mersenne Twister, have hidden defects. We show here that the test by Kim et al suffers from a subtle, but consequential error: Re-seeding the pseudorandom number generator with a fixed seed for ea...

Recent advances in predictive data analytics and ever growing digitalization and connectivity with explosive expansions in industrial and consumer Internet-of-Things (IoT) has raised significant concerns about security of people’s identities and data. It has created close to ideal environment for adversaries in terms of the amount of data that could be used for modeling and also greater accessi...