Results 1  10
of
20
TestU01: A C library for empirical testing of random number generators
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 2007
"... We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs). It provides general implementations of the classical statistical tests for RNGs, as well as several ot ..."
Abstract

Cited by 85 (3 self)
 Add to MetaCart
We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs). It provides general implementations of the classical statistical tests for RNGs, as well as several others tests proposed in the literature, and some original ones. Predefined tests suites for sequences of uniform random numbers over the interval (0, 1) and for bit sequences are available. Tools are also offered to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of RNGs. That is, for a given kind of test and a given class of RNGs, to determine how large should be the sample size of the test, as a function of the generator’s period length, before the generator starts to fail the test systematically. Finally, the library provides various types of generators implemented in generic form, as well as many specific generators proposed in the literature or found in widelyused software. The tests can be applied to instances of the generators predefined in the library, or to userdefined generators, or to streams of random numbers produced by any kind of device or stored in files. Besides introducing TestU01, the paper provides a survey and a classification of statistical tests for RNGs. It also applies batteries of tests to a long list of widely used RNGs.
On synopses for distinctvalue estimation under multiset operations
 IN SIGMOD
, 2007
"... The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. We provide DV estimation techniques that are designed for use within a flexible and scalable “synopsis warehouse” architecture. In this setting, incom ..."
Abstract

Cited by 57 (8 self)
 Add to MetaCart
(Show Context)
The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. We provide DV estimation techniques that are designed for use within a flexible and scalable “synopsis warehouse” architecture. In this setting, incoming data is split into partitions and a synopsis is created for each partition; each synopsis can then be used to quickly estimate the number of DVs in its corresponding partition. By combining and extending a number of results in the literature, we obtain both appropriate synopses and novel DV estimators to use in conjunction with these synopses. Our synopses can be created in parallel, and can then be easily combined to yield synopses and DV estimates for arbitrary unions, intersections or differences of partitions. Our synopses can also handle deletions of individual partition elements. We use the theory of order statistics to show that our DV estimators are unbiased, and to establish moment formulas and sharp error bounds. Based on a novel limit theorem, we can exploit results due to Cohen in order to select synopsis sizes when initially designing the warehouse. Experiments and theory indicate that our synopses and estimators lead to lower computational costs and more accurate DV estimates than previous approaches.
TestU01: A Software Library in ANSI C for Empirical Testing of Random Number Generators
, 2007
"... This document describes the software library TestU01, implemented in the ANSI C language, and offering a collection of utilities for the (empirical) statistical testing of uniform random number generators (RNG). The library implements several types of generators in generic form, as well as many spec ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
This document describes the software library TestU01, implemented in the ANSI C language, and offering a collection of utilities for the (empirical) statistical testing of uniform random number generators (RNG). The library implements several types of generators in generic form, as well as many specific generators proposed in the literature or found in widelyused software. It provides general implementations of the classical statistical tests for random number generators, as well as several others proposed in the literature, and some original ones. These tests can be applied to the generators predefined in the library and to userdefined generators. Specific tests suites for either sequences of uniform random numbers in [0, 1] or bit sequences are also available. Basic tools for plotting vectors of points produced by generators are provided as well. Additional software permits one to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of RNGs. That is, for a given kind of test and a given class of RNGs, to determine how large should be the sample size of the test, as a function of the generator’s period length, before the generator starts to fail the test systematically.
Fast simulation of largescale growth models
"... Abstract. We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a “least action principle ” which characterizes the odometer function of the growth process. Starting from an educated guess for the odometer, we ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a “least action principle ” which characterizes the odometer function of the growth process. Starting from an educated guess for the odometer, we successively correct under and overestimates and provably arrive at the correct final state. The degree of speedup depends on the accuracy of the initial guess. Determining the size of the boundary fluctuations in internal diffusionlimited aggregation is a longstanding open problem in statistical physics. As an application of our method, we calculate the size of fluctuations over two orders of magnitude beyond previous simulations. Our data strongly support the conjecture that the fluctuations are logarithmic in the radius. 1.
AESBased BIST: SelfTest, Test Pattern Generation and Signature Analysis
 in 4th IEEE International Symposium on Electronic Design, Test and Applications. IEEE
, 2008
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. AESbased BIST: selftest, test pattern generation and signature analysis
Cryptography meets voting
, 2005
"... We survey the contributions of the entire theoretical computer science/cryptography community during 19752002 that impact the question of how to run verifiable elections with secret ballots. The approach based on homomorphic encryptions is the most successful; one such scheme is sketched in detail ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We survey the contributions of the entire theoretical computer science/cryptography community during 19752002 that impact the question of how to run verifiable elections with secret ballots. The approach based on homomorphic encryptions is the most successful; one such scheme is sketched in detail and argued to be feasible to implement. It is explained precisely what these ideas accomplish but also what they do not accomplish, and a short history of election fraud throughout history is included.
A Reliable Architecture for Parallel Implementations of the Advanced Encryption Standard
, 2009
"... This paper presents an online selftest architecture for hardware implementation of the Advanced Encryption Standard (AES). The solution exploits the inherent spatial replications of a parallel architecture for implementing functional redundancy at low cost. We show that the solution is very effect ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
This paper presents an online selftest architecture for hardware implementation of the Advanced Encryption Standard (AES). The solution exploits the inherent spatial replications of a parallel architecture for implementing functional redundancy at low cost. We show that the solution is very effective for online fault detection while keeping the area overhead very low. Moreover, the architectural modification for online test does not weaken the device with respect to sidechannel attacks based on power analysis. 1.
A strong nonrandom pattern in Matlab default random number generator
 URL http://www.cs.cas.cz/ ∼ savicky/papers/rand2006.pdf
, 2006
"... The default random number generator in Matlab versions between 5 and at least 7.3 (R2006b) has a strong dependence between the numbers zi+1, zi+16, zi+28 in the generated sequence. In particular, there is no index i such that the inequalities zi+1 < 1/4, 1/4 ≤ zi+16 < 1/2, and 1/2 ≤ zi+28 are ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
The default random number generator in Matlab versions between 5 and at least 7.3 (R2006b) has a strong dependence between the numbers zi+1, zi+16, zi+28 in the generated sequence. In particular, there is no index i such that the inequalities zi+1 < 1/4, 1/4 ≤ zi+16 < 1/2, and 1/2 ≤ zi+28 are satisfied simultaneously. This fact is proved as a consequence of the recurrence relation defining the generator. A random sequence satisfies the inequalities with probability 1/32. Another example demonstrating the dependence is a simple function f with values −1 and 1, such that the correlation between f(zi+1, zi+16) and sign(zi+28 − 1/2) is at least 0.416, while it should be zero. A simple distribution on three variables that closely approximates the joint distribution of zi+1, zi+16, zi+28 is described. The region of zero density in the approximating distribution has volume 4/21 in the three dimensional unit cube. For every integer 1 ≤ k ≤ 10, there is a parallelepiped with edges 1/2k+1, 1/2k and 1/2k+1, where the density of the distribution is 2k. Numerical simulation confirms that the distribution of the original generator matches the approximation within small random error corresponding to the sample size. 1