13214 search results - page 36 / 2643 » Pseudorandomness for network algorithms |
146
Voted
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
157
Voted
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
152
Voted
IH
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. A constraint-based watermarking technique has been introduced for the protection of intellectual properties such as hardware, software, algorithms, and solutions to hard ...
147
Voted
ATS
2000
IEEE
15 years 10 months ago
2000
IEEE
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
139
Voted
ICCAD
1997
IEEE
15 years 9 months ago
1997
IEEE
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...