106 search results - page 13 / 22 » Proving Lower Bounds Via Pseudo-random Generators |
CHES
1999
Springer
13 years 11 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
ENTCS
2007
13 years 7 months ago
2007
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
WCNC
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ï¬...