6142 search results - page 344 / 1229 » The Complexity of Partition Functions |
200
click to vote
INDOCRYPT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
186
click to vote
COMPLIFE
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
181
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
163
click to vote
FSE
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
154
Voted
SMI
2005
IEEE
16 years 7 days ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...