532 search results - page 2 / 107 » New Results on the Complexity of the Middle Bit of Multiplic... |
IACR
2011
12 years 5 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
FOCS
1995
IEEE
13 years 9 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
EKNOW
2009
13 years 3 months ago
2009
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...