457 search results - page 3 / 92 » Boolean algebras arising from information systems |
ACISP
2006
Springer
14 years 2 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...
ICNP
2007
IEEE
14 years 2 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
BMCBI
2010
13 years 8 months ago
2010
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
ACISP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...