ENUMERATING BOOLEAN FUNCTIONS Page 1 ENUMERATING BOOLEAN FUNCTIONS OF CRYPTOGRAPHIC SIGNIFICANCE
نویسنده
چکیده
In this paper we describe applications of functions from GF(2) m onto GF(2) n in the design of encryption algorithms. If such a function is to be useful it must satisfy a set of criteria, the actual definition of which depends on the type of encryption technique involved. This in turn means that it is important to ensure that the selected criteria do not restrict the choice of function too severely, i.e. the set of functions must be enumerated. We discuss some of the possible sets of criteria and then give partial results on the corresponding enumeration problems. Many open problems remain, some of them corresponding to well known hard enumeration questions.
منابع مشابه
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
In this paper, a new approach for enumerating the set prime implicants (PI) of a Boolean formula in conjunctive normal form (CNF) is proposed. It is based on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually i...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملEnumerating Satisfiable Propositional FormulCB
It is known experimentally that there is a threshold for satisfiability in 3-CNF formulre around the value 4.25 for the ratio of variables to clauses. It is also known that the threshold is sharp [Fri99], but that proof does not give a value for the threshold. We use purely combinatorial techniques to count the number of satisfiable boolean formulre given in conjunctive normal form. The intenti...
متن کاملEnumerating Minimal Hypotheses and Dualizing Monotone Boolean Functions on Lattices
Any monotone Boolean function on a lattice can be described by the set of its minimal 1 values. If a lattice is given as a concept lattice, this set can be represented by the set of minimal hypotheses of a classification context. Enumeration of minimal hypotheses in output polynomial time is shown to be impossible unless P = NP, which shows that dualization of monotone functions on lattices wit...
متن کاملEnumerating orientations of the free spikes
We show that there are exactly 2Dk inequivalent orientations of the rank-k free spike (k ≥ 4) where Dk is the k th Dedekind number. Our proof of this result is constructive and employs the monotone boolean functions.
متن کامل