Sciweavers

DM
2006
77views more  DM 2006»
13 years 11 months ago
Strong edge-coloring of graphs with maximum degree 4 using 22 colors
In 1985, Erdos and Ne
Daniel W. Cranston
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 11 months ago
A New Stream Cipher: Dicing
: In this paper, we will propose a new synchronous stream cipher named DICING, which can be taken as a clock-controlled one but with a new mechanism of altering steps. With the sim...
An-Ping Li
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
14 years 3 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
14 years 6 months ago
On the Security of Goldreich's One-Way Function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
Andrej Bogdanov, Youming Qiao