The internal state of the Klimov–Shamir number generator TF-1 consists of four words of size w bits each, whereas its intended strength is 22w. We exploit an asymmetry in its out...
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Abstract. We determine all exceptional units among the elements of certain groups of units in quartic number fields. These groups arise from a oneparameter family of polynomials w...