3328 search results - page 23 / 666 » On Plateaued Functions and Their Constructions |
188
click to vote
DM
1999
15 years 5 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
145
click to vote
NIPS
2000
15 years 7 months ago
2000
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
159
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
179
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
176
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...