This article reinterprets, under a common framework, previous results on location choice under delivered pricing. The paper clearly identifies the economic forces which explain why the socially optimal locations are an equilibrium of the location-price game in some models, and why they are not an equilibrium in other models. The paper shows that the rationale behind Hamilton et al. (Reg Sci Urb...

The standard approach for constructing a large-stretch pseudorandom generator given a one-way permutation or given a smaller-stretch pseudo-random generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is necessary, that is, whether there are constructions that do not involve composition. More formally, we consider black-box con...

In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number generator and consider how to more efficiently attack them in terms of fewer samples or outputs. We reduce the attacking problem to finding small solutions of systems of modular polynomial equations of the form ai+bix0+cixi+x0xi = 0 (mod p), and present two strategies to cons...

Internet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation are common practical aspects. In this work we will discuss how to improve the quality of random numbers independently from their generation algorithm. We pro...

We report a quantum random number generator based on the photon-number-path entangled state that is prepared by means of two-photon quantum interference at a beam splitter. The randomness in our scheme is truly quantum mechanical in origin since it results from the projection measurement of the entangled two-photon state. The generated bit sequences satisfy the standard randomness test.

Abstract Nearly all the evolution equations of physics are time-reversible, in the sense that a movie of the solution, played backwards, would obey exactly the same differential equations as the original forward solution. By way of contrast, stochastic approaches are typically not time-reversible, though they could be made so by the simple expedient of storing their underlying pseudorandom numb...

The Square Wave Method (SWM), previously introduced for the analysis of signals and images, is presented here as a mathematical tool suitable for the analysis of time series and signals. To show the potential that the SWM has to analyze many different types of time series, the results of the analysis of a time series composed of a sequence of 10,000 numerical values are presented here. These va...

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.