Construction of binary bent functions by FFT-like permutation algorithms

DOI10.1007/978-3-030-68071-8_5MaRDI QIDQ5157441zbMATH OpenOpenAlexFDO

Authors Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko Astola

Publication date 18 October 2021

Published in Recent Findings in Boolean Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-68071-8_5

Mathematics Subject Classification ID

Boolean functions (94D10)

Recommendations

• Construction algorithms for ternary bent functions derived from their particular properties
• scientific article; zbMATH DE number 426131
• scientific article; zbMATH DE number 177030
• Further investigations on permutation based constructions of bent functions
• Further constructions of infinite families of bent functions from new permutations and their duals

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Boolean functions and their applications in cryptography
• Cryptographic Boolean functions and applications.
• scientific article; zbMATH DE number 3140885 (Why is no real title available?)
• scientific article; zbMATH DE number 6508183 (Why is no real title available?)
• scientific article; zbMATH DE number 4021029 (Why is no real title available?)
• scientific article; zbMATH DE number 3666683 (Why is no real title available?)
• scientific article; zbMATH DE number 46528 (Why is no real title available?)
• scientific article; zbMATH DE number 3510923 (Why is no real title available?)
• The Relationship Between Two Fast Fourier Transforms

Cited in

(2)

• scientific article; zbMATH DE number 796497 (Why is no real title available?)
• Construction algorithms for ternary bent functions derived from their particular properties

This page was built for publication: Construction of binary bent functions by FFT-like permutation algorithms

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