New pseudo-planar binomials in characteristic two and related schemes

DOI10.1007/S10623-014-9958-0zbMATH Open1321.05023arXiv1304.7044OpenAlexW2010016384MaRDI QIDQ498987FDOQ498987

Authors: Sihuang Hu, Shuxing Li, Tao Zhang, Tao Feng, Gennian Ge 

Publication date: 29 September 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Planar functions in odd characteristic were introduced by Dembowski and Ostrom in order to construct finite projective planes in 1968. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and signal sets. Recently, a new notion of pseudo-planar functions in even characteristic was proposed by Zhou. These new pseudo-planar functions, as an analogue of planar functions in odd characteristic, also bring about finite projective planes. There are three known infinite families of pseudo-planar monomial functions constructed by Schmidt and Zhou, and Scherr and Zieve. In this paper, three new classes of pseudo-planar binomials are provided. Moreover, we find that each pseudo-planar function gives an association scheme which is defined on a Galois ring.

Full work available at URL: https://arxiv.org/abs/1304.7044

Recommendations

• Some planar monomials in characteristic 2
• Planar functions over fields of characteristic two
• Further study of planar functions in characteristic two
• Low-degree planar monomials in characteristic two
• Planar functions and perfect nonlinear monomials over finite fields

zbMATH Keywords

association schemeprojective planerelative difference setpseudo-planar function

Mathematics Subject Classification ID

Cryptography (94A60) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial structures in finite projective spaces (51E20) Finite affine and projective planes (geometric aspects) (51E15)

Cites Work

• Title not available (Why is that?)
• Pseudo-Paley graphs and skew Hadamard difference sets from presemifields
• Planes of order \(n\) with collineation groups of order \(n^ 2\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planar functions over fields of characteristic two
• ‐Relative Difference Sets and Their Representations
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Translates of linear codes over Z/sub 4/
• The weight distribution of a class of linear codes from perfect nonlinear functions
• A Family of Optimal Constant-Composition Codes
• Subschemes of some association schemes
• Systematic Authentication Codes From Highly Nonlinear Functions
• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Certain distance-regular digraphs and related rings of characteristic 4
• Some planar monomials in characteristic 2
• On the equivalence between real mutually unbiased bases and a certain class of association schemes
• Symplectic spreads, planar functions, and mutually unbiased bases

Cited In (7)

• Planar functions over fields of characteristic two
• Further study of planar functions in characteristic two
• Low-degree planar polynomials over finite fields of characteristic two
• Investigating rational perfect nonlinear functions
• A new construction of differentially 4-uniform \((n,n-1)\)-functions
• Explicit constructions of bent functions from pseudo-planar functions
• A family of planar binomials in characteristic 2

This page was built for publication: New pseudo-planar binomials in characteristic two and related schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498987)