16430 search results - page 590 / 3286 » On Computable Tree Functions |
173
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
At ASIACRYPT 2006, Chang et al. analyzed the indifferentiability of some popular hash functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and th...
197
click to vote
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
169
click to vote
SAC
1996
ACM
15 years 11 months ago
1996
ACM
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
181
click to vote
CRYPTO
2008
Springer
15 years 9 months ago
2008
Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
157
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...