2017•Cryptography and CommunicationsOpen access

On the normality of p-ary bent functions

Wilfried Meidl, Gottlieb Pirsic

Open full text 0 citations

Abstract

Depending on the parity of n and the regularity of a bent function f from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ , f can be affine on a subspace of dimension at most n/2, (n − 1)/2 or n/2 − 1. We point out that many p-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2-normal, i.e. affine on a n/2-dimensional subspace. However applying an algorithm by Canteaut et.al., some Boolean bent functions were shown to be not n/2-normal. We develop an algorithm for testing normality for functions from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ . Applying the algorithm, for some bent functions in small dimension we show that they do not take on the bound on normality. Applying direct sum of functions this yields bent functions with this property in infinitely many dimensions.

Open-access reader

About this research paper

What this paper is about

Depending on the parity of n and the regularity of a bent function f from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ , f can be affine on a subspace of dimension at most n/2, (n − 1)/2 or n/2 − 1. We point out that many p-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2-normal, i.e. affine on a n/2-dimensional subspace. However applying an algorithm by Canteaut et.al., some Boolean bent functions were shown to be not n/2-normal. We develop an algorithm for testing normality for functions from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ . Applying the algorithm, for some bent functions in small dimension we show that they do not take on the bound on normality. Applying direct sum of functions this yields bent functions with this property in infinitely many dimensions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Depending on the parity of n and the regularity of a bent function f from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ , f can be affine on a subspace of dimension at most n/2, (n − 1)/2 or n/2 − 1. We point out that many p-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2-normal, i.e. affine on a n/2-dimensional subspace. However applying an algorithm by Canteaut et.al., some Boolean bent functions were shown to be not n/2-normal. We develop an algorithm for testing normality for functions from F p n ${{\mathbb F}_{p}^{n}}$ to F p ${\mathbb F}_{p}$ . Applying the algorithm, for some bent functions in small dimension we show that they do not take on the bound on normality. Applying direct sum of functions this yields bent functions with this property in infinitely many dimensions.

Key concepts: Bent molecular geometry, Boolean function, Combinatorics, Bent function, Normality, Dimension (graph theory), Mathematics, Subspace topology

Related papers

Back to paper searchBrowse research topicsOriginal source
On the normality of p-ary bent functions — Research Paper | ScholarLens