15 search results - page 1 / 3 » Substitution-Permutation Networks, Pseudorandom Functions, a... |
CRYPTO
2012
Springer
11 years 8 months ago
2012
Springer
ECCC
2011
12 years 9 months ago
2011
FOCS
2008
IEEE
14 years 22 days 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...
ACNS
2010
Springer
13 years 11 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...