Construction of Binary Bent Functions by FFT-Like Permutation Algorithms

DOI10.1007/978-3-030-68071-8_5zbMath1484.94047OpenAlexW4252978309MaRDI QIDQ5157441

Radomir S. Stanković, Claudio Moraga, Milena Stanković, Jaakko T. 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)

Cites Work

• Boolean functions and their applications in cryptography
• An Algorithm for the Machine Calculation of Complex Fourier Series
• The Relationship Between Two Fast Fourier Transforms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Construction of Binary Bent Functions by FFT-Like Permutation Algorithms