A new construction of bent functions based on \({\mathbb{Z}}\)-bent functions

DOI10.1007/s10623-012-9687-1zbMath1283.06024OpenAlexW2002704520MaRDI QIDQ1934236

Yanyan Li

Publication date: 28 January 2013

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

Full work available at URL: https://doi.org/10.1007/s10623-012-9687-1

zbMATH Keywords

Fourier transformBoolean functions\({\mathbb{Z} }\)-bent functions

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items

Four decades of research on bent functions ⋮ Unnamed Item ⋮ Generic constructions of \(\mathbb{Z}\)-bent functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bent functions embedded into the recursive framework of \(\mathbb{Z}\)-bent functions
• On ``bent functions
• On affine (non)equivalence of Boolean functions
• A characterization of binary bent functions
• Decomposing bent functions
• Generalized partial spreads
• Counting Partial Spread Functions in Eight Variables