Sciweavers

Share
IACR
2011
106views more  IACR 2011»
8 years 6 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
RSA
2011
102views more  RSA 2011»
9 years 1 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
DM
1999
90views more  DM 1999»
9 years 6 months ago
Induced subgraphs of given sizes
We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur
Paul Erdös, Zoltán Füredi, Bruce ...
books