Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity, propagation criteria) which a cryptographically strong Boolean function ought to have. We study the above me...

Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...

Given a Boolean algebra B and an embedding e : B → P(N)/ fin we consider the possibility of extending each or some automorphism of B to the whole P(N)/ fin. Among other things, we show, assuming CH, that for a wide class of Boolean algebras there are embeddings for which no non-trivial automorphism can be extended.

A one to one correspondence between regular generalized bent functions from Fn2 to Z2m , and m−tuples of Boolean bent functions is established. This correspondence maps selfdual (resp. anti-self-dual) generalized bent functions to m−tuples of self-dual (resp. anti self-dual) Boolean bent functions. An application to the classification of regular generalized bent functions under the extended aff...

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/∼antoniou/bs. After extensive testing,...

There are two major shortcomings of the Boolean Retrieval Model that has attracted many researchers to improve the model since 1980s. These two problems are: inability to accommodate term weight in boolean queries and being unable to rank in Boolean Retrieval Model. Approaches to improve these two disadvantages can help us to achieve better precision and recall results for information retrieval...

We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today’s most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The ...

The universal isol metatheorem is extended so as to deal with nonrecursive relations and countable Boolean operations.