61 search results - page 4 / 13 » Arbitrary Bit Permutations in One or Two Cycles |
FSE
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds ...
WAW
2009
Springer
14 years 1 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
CGF
2008
13 years 7 months ago
2008
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...
ICALP
2005
Springer
14 years 15 days ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
ASIACRYPT
2006
Springer
13 years 10 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...