Construction of binary bent functions by FFT-like permutation algorithms

DOI10.1007/978-3-030-68071-8_5zbMATH Open1484.94047OpenAlexW4252978309MaRDI QIDQ5157441FDOQ5157441

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

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

Mathematics Subject Classification ID

Boolean functions (94D10)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Cryptographic Boolean functions and applications.
• Title not available (Why is that?)
• Boolean functions and their applications in cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Relationship Between Two Fast Fourier Transforms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Construction algorithms for ternary bent functions derived from their particular properties
• Title not available (Why is that?)

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)