331 search results - page 6 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
SCL
2008
13 years 9 months ago
2008
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
COMPGEOM
1999
ACM
14 years 1 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
CRYPTO
2000
Springer
14 years 20 days ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
ICALP
2011
Springer
13 years 15 days ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...