Difference between revisions of "Boolean function"
Jon Awbrey (talk | contribs) (trim) |
Jon Awbrey (talk | contribs) (trim) |
||
| Line 2: | Line 2: | ||
There are <math>2^{2^k}</math> such functions. These play a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for [[digital computer]]s. The properties of boolean functions play a critical role in [[cryptography]], particularly in the design of [[symmetric key algorithm]]s (see [[S-box]]). | There are <math>2^{2^k}</math> such functions. These play a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for [[digital computer]]s. The properties of boolean functions play a critical role in [[cryptography]], particularly in the design of [[symmetric key algorithm]]s (see [[S-box]]). | ||
| − | |||
| − | |||
| − | |||
| − | |||
==See also== | ==See also== | ||
Revision as of 13:12, 22 October 2008
In mathematics, a finitary boolean function is a function of the form \(f : \mathbb{B}^k \to \mathbb{B},\) where \(\mathbb{B} = \{ 0, 1 \}\) is a boolean domain and where \(k\!\) is a nonnegative integer. In the case where \(k = 0,\!\) the function is simply a constant element of \(\mathbb{B}.\)
There are \(2^{2^k}\) such functions. These play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers. The properties of boolean functions play a critical role in cryptography, particularly in the design of symmetric key algorithms (see S-box).
See also
Template:Col-breakTemplate:Col-breakTemplate:Col-endExternal links
- Boolean Planet — boolean functions in cryptography.
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
