Sciweavers

247 search results - page 44 / 50
» On Pseudorandom Generators in NC
Sort
View
CORR
2006
Springer
71views Education» more  CORR 2006»
13 years 7 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
TIT
2008
130views more  TIT 2008»
13 years 7 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
Sihem Mesnager
ENTCS
2002
88views more  ENTCS 2002»
13 years 7 months ago
Testing Concurrent Java Programs using Randomized Scheduling
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
Scott D. Stoller
ECCC
1998
80views more  ECCC 1998»
13 years 7 months ago
Extracting All the Randomness from a Weakly Random Source
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
Salil P. Vadhan
COLT
2010
Springer
13 years 5 months ago
Mansour's Conjecture is True for Random DNF Formulas
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
Adam R. Klivans, Homin K. Lee, Andrew Wan