Design methods for semi-bent functions

DOI10.1016/J.IPL.2018.12.002zbMath1487.94213OpenAlexW2903003269WikidataQ128813089 ScholiaQ128813089MaRDI QIDQ1711436

Sugata Gangopadhyay, Enes Pašalić, Samed Bajrić, Wei Guo Zhang

Publication date: 18 January 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.12.002

zbMATH Keywords

cryptographyBoolean functionsderivativesbent functionssemi-bent functions

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Related Items (3)

Algebraic construction of near-bent function with application to cryptography ⋮ Three classes of balanced vectorial semi-bent functions ⋮ Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On ``bent functions
• Partially-bent functions
• Quadratic functions with prescribed spectra
• Affine inequivalence of cubic Maiorana-McFarland type bent functions
• Special bent and near-bent functions
• Nonexistence of certain types of plateaued functions
• A family of difference sets in non-cyclic groups
• Semi-bent Functions from Oval Polynomials
• Semi-bent Functions with Multiple Trace Terms and Hyperelliptic Curves
• Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
• Decomposing bent functions
• On Bent and Semi-Bent Quadratic Boolean Functions
• On cryptographic properties of the cosets of R(1, m)
• Two New Classes of Bent Functions
• On Semi-bent Functions and Related Plateaued Functions Over the Galois Field 𝔽 2 n $$\mathbb{F}_{2^{n}}$$
• On Semibent Boolean Functions
• Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials
• Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices
• Bent Functions
• Cryptography and Coding
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)

This page was built for publication: Design methods for semi-bent functions