Bent and Semi-bent Functions via Linear Translators

DOI10.1007/978-3-319-27239-9_13zbMath1376.94036OpenAlexW2395115528MaRDI QIDQ3460108

Neşe Koçak, Ferruh Özbudak, Sihem Mesnager

Publication date: 12 January 2016

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_13

zbMATH Keywords

Boolean functionsbent functionslinear structuresWalsh-Hadamard transformsemi-bent functionslinear translators and derivatives

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items

Four decades of research on bent functions ⋮ New Bent Functions from Permutations and Linear Translators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further constructions of infinite families of bent functions from new permutations and their duals
• Sparse permutations with low differential uniformity
• When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
• Four decades of research on bent functions
• On ``bent functions
• Constructing permutations of finite fields via linear translators
• Piecewise constructions of bent and almost optimal Boolean functions
• Semi-bent Functions from Oval Polynomials
• Several New Infinite Families of Bent Functions and Their Duals
• On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
• Open Problems on Binary Bent Functions
• On Semi-bent Functions and Related Plateaued Functions Over the Galois Field 𝔽 2 n $$\mathbb{F}_{2^{n}}$$
• Polynomials With Linear Structure and Maiorana–McFarland Construction
• Bent Functions
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Fast Software Encryption