397 search results - page 52 / 80 » Pseudorandom Functions and Lattices |
130
click to vote
CAV
2012
Springer
13 years 3 months ago
2012
Springer
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
102
click to vote
COCO
2003
Springer
15 years 6 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} ...
136
click to vote
DAM
2011
14 years 8 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
102
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
101
click to vote
EUROCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...