Correlation-immunity is a cryptographic criterion on Boolean functions arising from correlation attacks on combining functions. When it comes to filtering functions, the status of correlation-immunity lacks study in itself and, if it is commonly accepted as a requirement for nonlinear filter generators, this is for other concerns. We revisit the concept of correlation-immunity and clear up its ...

Binary and unary operation preserving binary relations and quotients of those operations modulo equivalence relations are introduced. It is shown that the quotients inherit some important properties (commutativity, associativity, distributivity, ect.). Based on it the quotient (also called factor) lattice modulo filter (ie. modulo the equivalence relation w.r.t the filter) is introduced. Simila...

slow sand filters are as a proper technology for pre-treatment of raw water, with a fine and medium trubidity in small communities in developing countries. thus, with a minimum operation cost and minimum need for expest bodies have the maximum efficiency. the purpose of this research is carried out to evaluate the efficiency of two processes of horizontal flow roughing filter and vertical flow ...

In this paper, A Switchable Filtering Antenna Integrated With U-Shaped Resonators for Bluetooth, WLAN & UWB Applications is presented. To achieve the operation, a rectangular defect on ground plane and square slots are etched patch. The selectivity of frequency achieved by integrating Hairpin filter. Three switches connected at corners filter to re-configurability. total eight Boolean combi...

The FLIP cipher was proposed at Eurocrypt 2016 for the purpose of meliorating efficiency fully homomorphic cryptosystems. Weightwise perfectly balanced Boolean functions meet balancedness requirement filter function in ciphers, and construction them has attracted serious attention from researchers. Nevertheless, literature is still thin. Modifying supports with a low degree general technique wh...

Let A =< A,≤A> and B =< B,≤B> be lattices such that A ∩ B is a filter in A and an ideal in B, and the orderings ≤A and ≤B coincide on A ∩ B. Then ≤A ∪ ≤B ∪ (≤A ◦ ≤B), is a lattice ordering on A ∪ B and the resulting lattice, called a sum of A and B, is denoted by A ⊕ B. The sum operation was introduced by Wroński [5], and its special case with A∩B = {1A} = {0B} by Troelstra [4]. In particular, ...

A class of nonlinear digital filters, called the threshold Boolean filter (TBF), is introduced. The TBF is defined by a Boolean function on the binary domain and is a natural extension of stack filters. Multilevel representations of a TBF corresponding to a Boolean function are derived; a TBF can be represented either as a sum of “local minimum-local maximum” terms or as an adaptive linear comb...