Sciweavers

1696 search results - page 36 / 340
» Permuted function matching
Sort
View
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
CRYPTO
1998
Springer
137views Cryptology» more  CRYPTO 1998»
15 years 2 months ago
Building PRFs from PRPs
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
GLOBECOM
2010
IEEE
14 years 8 months ago
Information Theoretic Optimal Broadband Matching for Communication Systems
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
Pawandeep S. Taluja, Brian L. Hughes
CSDA
2006
145views more  CSDA 2006»
14 years 10 months ago
Improved predictions penalizing both slope and curvature in additive models
A new method is proposed to estimate the nonlinear functions in an additive regression model. Usually, these functions are estimated by penalized least squares, penalizing the cur...
Magne Aldrin
CEC
2007
IEEE
15 years 4 months ago
Non-separable fitness functions for evolutionary shape optimization benchmarking
—Target shape matching can be used as a quick and easy surrogate task when evaluating optimization algorithms intended for computationally expensive tasks, such as turbine blade ...
Tim A. Yates, Thorsten Schnier