Metraipolis › archive › dc_dacfbb34a85f

Bent function — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bent_function
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:23:35.710Z
SHA-256 of the archived text
297863e881b2579eb503c248b40a75d91e28089420c0cff0b8672e08a6f5c706
Stable URL of this page
https://metraipolis.com/documento/dc_dacfbb34a85f

How to cite

Bent function — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bent_function (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_dacfbb34a85f (Metraipolis archive dc_dacfbb34a85f, sha256 297863e881b2579eb503c248b40a75d91e28089420c0cff0b8672e08a6f5c706)
BibTeX
@misc{dcdacfbb34a85f,
  title = {Bent function — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bent_function},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_dacfbb34a85f; sha256 297863e881b2579eb503c248b40a75d91e28089420c0cff0b8672e08a6f5c706},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bent_function. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In the mathematical field of combinatorics, a bent function is a Boolean function that is maximally non-linear; it is as different as possible from the set of all linear and affine functions when measured by Hamming distance between truth tables. Concretely, this means the maximum correlation between the output of the function and a linear function is minimal. In addition, the derivatives of a bent function are balanced Boolean functions, so for any change in the input variables there is a 50 percent chance that the output value will change. The maximal nonlinearity means approximating a bent function by an affine (linear) function is hard, a useful property in the defence against linear cryptanalysis. In addition, detecting a change in the output of the function yields no information about what change occurred in the inputs, making the function immune to differential cryptanalysis. Bent functions were defined and named in the 1960s by Oscar Rothaus in research not published until 1976. They have been extensively studied for their applications in cryptography, but have also been applied to spread spectrum, coding theory, and combinatorial design. The definition can be extended in several ways, leading to different classes of generalized bent functions that share many of the useful properties of the original. It is known that V. A. Eliseev and O. P. Stepchenkov studied bent functions, which they called minimal functions, in the USSR in 1962. However, their results have still not been declassified. Bent functions are also known as perfectly nonlinear (PN) Boolean functions. Certain functions that are as close as possible to perfect nonlinearity (e.g. for functions of an odd number of bits, or vectorial functions) are known as almost perfectly nonlinear (APN).

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Bent function» — https://en.wikipedia.org/wiki/Bent_function
Wikidata Q4890350: «special type of Boolean function» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4890350
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bent_function?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1368736978, consultata il 2026-10-06T10:39:13.127Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 75f207ebf5516074b731d0462a55a909f03a34d8d5dff03424bdde50708fe35d