منابع مشابه
On Randomness of Goldbach Sequences
We consider the use of Goldbach numbers as random sequences. The randomness is analyzed in terms of the autocorrelation function of the sequence of number of partitions. The distinct representations of an even number n as the sum of two primes is a local maximum for multiples of the product of the consecutive smallest primes less than the number. Specific partitions, which we call Goldbach elli...
متن کاملLocal Randomness in Pseudo - random Sequences 1
The concept of provable cryptographic security for pseudo-random number generators that was introduced by Schnorr is investigated and extended. The cryptanalyst is assumed to have in nite computational resources and hence the security of the generators does not rely on any unproved hypothesis about the di culty of solving a certain problem, but rather relies on the assumption that the number of...
متن کاملOn detecting and quantification of randomness for one-sided sequences
The paper studies discrete time processes and their predictability and randomness in deterministic pathwise setting, without using probabilistic assumptions on the ensemble. We suggest some frequency based criterions of predictability based on bandlimitness and some approaches to quantification of randomness based on frequency analysis of two-sided and one-sided sequences. We develop procedure ...
متن کاملA Modular approach on Statistical Randomness Study of bit sequences
Randomness studies of bit sequences, created either by a ciphering algorithm or by a pseudorandom bit generator are a subject of prolonged research interest. During the recent past the 15 statistical tests of NIST turn out to be the most important as well as dependable tool for the same. For searching a right pseudorandom bit generator from among many such algorithms, large time is required to ...
متن کاملA New Randomness Test for Bit Sequences
Generating sequences of random numbers or bits is a necessity in many situations (cryptography, modeling, simulations, etc. . .). Those sequences must be random in the sense that their behavior should be unpredictable. For example, the security of many cryptographic systems depends on the generation of unpredictable values to be used as keys. Since randomness is related to the unpredictable pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1941
ISSN: 0003-4851
DOI: 10.1214/aoms/1177731711