33 search results - page 2 / 7 » Some Topics in Analysis of Boolean Functions |
ACISP
2006
Springer
13 years 11 months ago
2006
Springer
![On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "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...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
DATE
2004
IEEE
13 years 9 months ago
2004
IEEE
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. Noise analysis techniques can detect some of such noise faults, but accu...
CPC
2004
13 years 5 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
LREC
2010
13 years 6 months ago
2010
This paper discusses our ongoing work on constructing an annotated corpus of children's stories for further studies on the linguistic, computational, and cognitive aspects of...