Catálogo de publicaciones - libros

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.

We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis that the sequence is generated by a stationary and ergodic source which differs from the source under . We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.