Graphs of vectorial plateaued functions as difference sets
From MaRDI portal
Publication:2662037
DOI10.1016/j.ffa.2020.101795zbMath1460.05028arXiv1807.11181OpenAlexW3117304545MaRDI QIDQ2662037
Publication date: 8 April 2021
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.11181
plateaued functionspartial geometric designspartial geometric difference setsthree-valued cross-correlation function
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Graph theory (05C99) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items
Secondary constructions of (non)weakly regular plateaued functions over finite fields ⋮ Partial direct product difference sets and almost quaternary sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Directed strongly regular graphs from \(1\frac 12\)-designs
- Plateaued functions and one-and-half difference sets
- Four decades of research on bent functions
- Strongly regular graphs associated with ternary bent functions
- On ``bent functions
- Some results about the cross-correlation function between two maximal linear sequences
- Nonlinear functions in abelian groups and relative difference sets.
- On the \(p\)-ary (cubic) bent and plateaued (vectorial) functions
- A link between combinatorial designs and three-weight linear codes
- Partially-bent functions
- Finite geometry and character theory
- Association schemes arising from bent functions
- Weights of linear codes and strongly regular normed spaces
- Results on Characterizations of Plateaued Functions in Arbitrary Characteristic
- Characterizations of Plateaued and Bent Functions in Characteristic $$p$$
- Boolean and Vectorial Plateaued Functions and APN Functions
- Linear Codes From Some 2-Designs
- Optical orthogonal codes: design, analysis and applications
- Bent polynomials over finite fields
- On cryptographic properties of the cosets of R(1, m)
- A characterization of bent functions in terms of strongly regular graphs
- Symmetric ‐Designs and ‐Difference Sets
- Relative Difference Families With Variable Block Sizes and Their Related OOCs
- Bent Functions
- Explicit Characterizations for Plateaued-ness of p-ary (Vectorial) Functions
- Fast Software Encryption