Sciweavers

36781 search results - page 87 / 7357
» Parameterizing by the Number of Numbers
Sort
View
JOC
2007
81views more  JOC 2007»
13 years 10 months ago
Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1
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...
Boaz Tsaban
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 10 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
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...
Harald Niederreiter, Arne Winterhof
CORR
2004
Springer
106views Education» more  CORR 2004»
13 years 10 months ago
Why Delannoy numbers?
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...
Cyril Banderier, Sylviane R. Schwer
MOC
2000
132views more  MOC 2000»
13 years 10 months ago
Lattice computations for random numbers
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 ...
Raymond Couture, Pierre L'Ecuyer
MOC
1998
65views more  MOC 1998»
13 years 10 months ago
Exceptional units in a family of quartic number fields
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...
Gerhard Niklasch, Nigel P. Smart