Sciweavers

2767 search results - page 374 / 554
» Universal Exponentiation Algorithm
Sort
View
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
15 years 3 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 3 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
APAL
2007
131views more  APAL 2007»
15 years 2 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 2 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 2 months ago
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
Yakir Reshef, Salil P. Vadhan