Recently, algebraic attacks have received a lot of attention in the cryptographic literature. It
has been observed that a Boolean function f used as a cryptographic primitive, and …

So far there is no systematic attempt to construct Boolean functions with maximum
annihilator immunity. In this paper we present a construction keeping in mind the basic …

Algebraic attack has recently become an important tool in cryptanalysing different stream
and block cipher systems. A Boolean function, when used in some cryptosystem, should be …

Since the introduction of the notions of nonlinearity in the mid-70's (the term has been in fact
introduced later), of correlation immunity and resiliency in the mid-80's, and of algebraic …

In this paper we present a new class of stream ciphers based on a very simple mechanism.
The heart of our method is a Feedback with Carry Shift Registers (FCSR) automaton. This …

In this paper, we study the algebraic immunity of Boolean functions and consider in
particular the problem of constructing Boolean functions with a good algebraic immunity. We …

It has been noted recently that algebraic (annihilator) immunity alone does not provide
sufficient resistance against algebraic attacks. In this regard, given a Boolean function f, just …

Given a Boolean function f on n-variables, we find a reduced set of homogeneous linear
equations by solving which one can decide whether there exist annihilators at degree d or …

In this thesis we discuss certain properties of Boolean functions that are necessary for
resistance against algebraic and fast algebraic attacks. A Boolean function f (x 1,..., xn) on n …

This paper gives a construction method which can get a large class of Boolean functions
with maximum algebraic immunity (AI) from one such giving function. Our constructions get …