Sciweavers

56 search results - page 7 / 12
» Functional Correctness Proofs of Encryption Algorithms
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ECCV
2004
Springer
14 years 9 months ago
Weighted Minimal Hypersurfaces and Their Applications in Computer Vision
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
Bastian Goldlücke, Marcus A. Magnor
ACISP
2006
Springer
14 years 1 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
ICML
2008
IEEE
14 years 8 months ago
Learning all optimal policies with multiple criteria
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
Leon Barrett, Srini Narayanan
WEA
2010
Springer
397views Algorithms» more  WEA 2010»
14 years 2 months ago
A New Combinational Logic Minimization Technique with Applications to Cryptology
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
Joan Boyar, René Peralta