2186 search results - page 205 / 438 » Considering an Organization's Memory |
205
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
164
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
183
click to vote
SIROCCO
2001
15 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
147
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
183
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete sourc...