4498 search results - page 159 / 900 » How to Invent Functions |
142
click to vote
EOR
2008
15 years 4 months ago
2008
Heterogeneous wireless/wired networks and ubiquitous environments are gaining ever more attention by research community. To properly control and manage such puzzles a deep knowled...
122
click to vote
ACISP
2008
Springer
15 years 10 months ago
2008
Springer
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...
121
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Re-occurrence of the same problem is very common in many large software products. By matching the symptoms of a new problem to those in a database of known problems, automated dia...
123
click to vote
FSE
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong et al. at FSE 2006. This cryptanalysis is based on some unexpected differential...
118
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...