In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient algorithm for computing the algebraic immunity of a symmetric function. The existence of several symmetric functions with maximum algebraic immunity is proven. In this way, a new class of function which have good implem...

 The class of ads modules with the SIP (briefly‎, ‎$SA$-modules) is studied‎. ‎Various conditions for a module to be $SA$-module are given‎. ‎It is proved that for a quasi-continuous module $M$‎, ‎$M$ is a UC-module if and only if $M$ is an $SA$-module‎. ‎Also‎, ‎it is proved that the direct sum of two $SA$-modules as $R$-modules is an $SA$-module when $R$ is the sum of the annihilators of thes...

Introduction 2 1. A Guide to Duality 3 1.1. Local Duality 3 1.2. Dualizing Complexes and Some Vanishing Theorems 10 1.3. Cohomological Annihilators 17 2. A Few Applications of Local Cohomology 21 2.1. On Ideal Topologies 21 2.2. On Ideal Transforms 25 2.3. Asymptotic Prime Divisors 28 2.4. The Lichtenbaum-Hartshorne Vanishing Theorem 35 2.5. Connectedness results 37 3. Local Cohomology and Syzy...

We study a new notion of trace operators and spaces for abstract Hilbert complexes. introduce as quotient spaces/annihilators. characterize the kernels images related discuss duality relationships between spaces. elaborate that many properties classical boundary traces associated with Euclidean de Rham complex on bounded Lipschitz domains are rooted in general structure arrive at complexes can ...

In this paper, we generalize a result of Karpenko on the torsion in the second quotient of the gamma filtration for Severi-Brauer varieties to higher degrees. As an application, we provide a nontrivial torsion in higher Chow groups and the topological filtration of the associated generic variety and obtain new upper bounds for the annihilators of the torsion subgroups in the Chow groups of a la...

The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very efficient if this system is of low degree. In particular, they have been used to break stream ciphers immune to all previously known attacks. This kind of attack tends to work when certain Boolean functions used in the c...