175 search results - page 19 / 35 » Bounds for Permutation Rate-Distortion |
TVLSI
1998
14 years 11 months ago
1998
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
FSE
2010
Springer
15 years 2 months ago
2010
Springer
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
CRYPTO
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
STOC
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...