Source-linked AI summary

General constructions of normal bent partitions related to vectorial dual-bent functions

Alexander Kholosha, Mohit Pal

arXiv:2610.03420v1math.COcs.DM

TL;DR

The paper addresses construction of normal bent partitions, a class whose known depth>4 examples were Type I with a subspace cell. It uses permutation polynomials and normal m-partitions; stated conditions yield regular bent functions, including a partial-spread case.

  • Problem

    For depth K>4, known bent partitions were Type I with an m-dimensional subspace as their distinguished cell, motivating constructions of normal bent partitions.

    Source: §1 · p. 2
  • Method

    The paper combines normal m-partitions using permutation polynomials to construct normal bent partitions.

    Source: §1 · p. 2, §2 · p. 3, §3 · p. 8
  • Results

    Under the stated linearized-polynomial conditions, both constructions give normal bent partitions whose generated bent functions are regular.

    Source: §2 · p. 7
  • Takeaways & Limitations

    When k=m and π1 is a linear permutation, the first construction is a spread and its bent functions belong to the partial spread class.

    Source: §4 · p. 13

    Because G◦Lt varies with t, the paper does not identify it as a vectorial dual of F.

    Source: §5 · p. 15

Abstract

from arXiv · show

Bent partitions were introduced as a generalization of partial spread construction of bent functions and they became a hot research topic recently. In this paper, we prove two general constructions of normal bent partitions that are related to vectorial dual-bent functions. They cover many of the currently known bent partitions of this type as partial cases. These constructions also provide a large number of new bent partitions. Relevant properties of bent functions obtained from such partitions are proven.

1. Introduction

Bent partitions shift the bentness condition from individual functions to a partition-level property. The paper targets normal bent partitions and constructs them using permutation polynomials and normal m-partitions.

1. Introduction

  • Bent functions have maximum Hamming distance from affine functions and constant absolute-square Walsh coefficients, with links to combinatorics, coding, sequences, and cryptography.The introduction also notes that complete classification remains elusive, particularly for p-ary bent functions.Source: §1 · p. 1
  • Bent partitions were introduced because bentness is a property of the partition, not only of an individual function..Source: §1 · p. 2
  • A bent partition is one for which functions constant on one cell and meeting the specified distribution across the other cells are bent.The definition requires each Dj to contain exactly K/p elements of the partition other than A0.Source: §1 · p. 2
  • For depth K>4, all bent partitions known so far are Type I, with A0 an m-dimensional subspace; these are normal bent partitions.The introduction defines normal bent partitions as partitions whose distinguished cell is an m-dimensional subspace.Source: §1 · p. 2
  • The paper uses permutation polynomials and normal m-partitions to construct normal bent partitions, with particular choices covering previously known examples.The construction combines elements of m-partitions into partitions of Fq2; the sets need only be disjoint and cover the whole space.Source: §1 · p. 2

2. Normal Bent Partitions of Type I (Construction 1)

Construction 1 combines a normal m-partition with sets formed from its elements to obtain a normal partition. Under a linearized-polynomial condition, that partition is bent and its generated bent functions are regular.

2. Normal Bent Partitions of Type I (Construction 1)

  • The construction forms a normal m-partition from U and the Uj sets, then combines its elements into a normal partition.The resulting A1(γ) sets have size p^(m−k)(q−1).Source: §2 · p. 3
  • When B is linear, f1 is bent exactly for the stated trace-form B, and the resulting function is regular with components in the completed original Maiorana–McFarland class.With trace-form B, each component function is bent.Source: §2 · pp. 4, 6
  • If π1^-1(x) reduced modulo x^pk−x is linearized, S1 is a normal bent partition and all bent functions it generates are regular.For q>3, every bent function constant on S1 also has the prescribed distribution across its cells.Source: §2 · pp. 4, 7
  • The construction also applies for p=2 by changing β and defining the Uj bijections accordingly.The proof is stated to follow the same argument as Theorem 2.1.Source: §2 · p. 7

3. Normal Bent Partitions of Type I (Construction 2)

Construction 2 forms normal bent partitions of Type I from a partition of Fq², and characterizes bent functions obtained from them through conditions on B and π₂.

Construction 2

  • The construction combines the sets Vⱼ into a normal partition of Fq², with |A₂(γ)| = pᵐ⁻ᵏ(q − 1) for every γ ∈ Fpᵏ.The Vⱼ are disjoint apart from zero, and the construction first forms a normal m-partition.Source: §3 · p. 8
  • For a + a^q = 0, Theorem 3.1 gives Wf₂(a) = qζc and f₂*(a) = c; for a ∈ Fq*, it gives Wf₂(a) = q and f₂*(a) = 0.These coefficient statements apply to any f₂ given by (3.3).Source: §3 · p. 8
  • If B is linear on Fpᵏ, f₂ is bent exactly when B(γ) = Trₖ(t′γ) for some t′, and then f₂ is regular.The theorem also identifies its dual in this case as belonging to the completed original Maiorana–McFarland class with associated subspace V.Source: §3 · p. 8
  • Theorem 3.1 also gives a bentness criterion for the case where π₂⁻¹(x) modulo x^pᵏ−x is linearized, and the result extends to p = 2.The condition is stated for π₂⁻¹ reduced modulo x^pᵏ−x; the binary extension is noted in Remark 3.3.Source: §3 · pp. 8, 12
  • When π₂⁻¹(x) modulo x^pᵏ−x is linearized, S₂ is a normal Type I bent partition, and all generated bent functions are regular.For q > 3, every p-ary bent function constant on S₂ has exactly pᵏ−1 elements of S₂ \ {U} in each Dⱼ.Source: §3 · pp. 8, 12

4. Examples of Bent Partitions of Type I

The examples express both constructions through a bivariate bijection and show how particular parameter choices recover Desarguesian and generalized Desarguesian spreads.

Construction 1 examples

  • Construction 1 has bivariate sets U = (0, y) and Uⱼ = (x, jπ₁(x)); with k = m and π₁ the identity, its partition is the Desarguesian spread.The section presents this as a special case of the bivariate representation through ψ.Source: §4 · pp. 12–13
  • For π₁(x) = xᵉ with gcd(e, q − 1) = 1 and e ≡ pˡ (mod pᵏ − 1), S₁ is called a generalized Desarguesian spread.The paper notes that its elements need not be subspaces, so it reserves “spread” for partitions whose elements have subspace structure.Source: §4 · p. 13
  • When k = m and π₁ is linear, S₁ is a spread and its bent functions belong to the partial spread class.With π₁ the identity, S₁ reduces to the Desarguesian spread.Source: §4 · p. 13

Construction 2 examples

  • Construction 2 has bivariate sets V = (x, 0) and Vⱼ = (jπ₂(y), y); with k = m and π₂ the identity, S₂ is the Desarguesian spread.The corresponding function reduces to the stated special-case form.Source: §4 · pp. 13–14
  • For π₂(x) = xᵈ with gcd(d, q − 1) = 1 and d ≡ pˡ (mod pᵏ − 1), S₂ is called a generalized Desarguesian spread.Bent functions from generalized Desarguesian spreads have been called generalized PSap bent functions.Source: §4 · p. 14

5. Vectorial Bent Functions and Duality

The section defines vectorial dual-bentness through the component duals forming another vectorial bent function, then relates this property and Condition A to normal bent partitions satisfying Condition C.

  • Each component of F* is the dual of the corresponding component F_-t, whereas the varying G◦L_t cannot be called a vectorial dual of F.Source: §5 · pp. 15–16
  • Proposition 5.4 establishes that F is vectorial dual-bent and satisfies Condition A.Source: §5 · p. 16
  • For nonzero t1 + t2, the sum of the duals of F_t1 and F_t2 equals the dual of F_t1+t2.Source: §5 · p. 16
  • Joining U with some A(γ) yields a bent partition satisfying Condition C, and the cited result also gives this property for the preimage partition defined by F.Source: §5 · p. 16
  • With appropriate π1, the normal bent partition S1 satisfies Condition C.Source: §5 · p. 16
  • With an appropriate π2, the normal bent partition S2 satisfies Condition C; the same holds for the modified partitions when p = 2.Source: §5 · p. 17
Loading 2610.03420v1…