Computing Walsh coefficients from the algebraic normal form of a Boolean function
From MaRDI portal
Publication:458740
DOI10.1007/S12095-014-0103-8zbMATH Open1352.94098OpenAlexW1986378295MaRDI QIDQ458740FDOQ458740
Authors: Xinxin Gong, Wenling Wu, Dengguo Feng, Bin Zhang 
Publication date: 8 October 2014
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-014-0103-8
Recommendations
- Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
- Computing the Weight of a Boolean Function from Its Algebraic Normal Form
- Multiplicative properties of the spectral Walsh coefficients of a Boolean function
- Fast computing the algebraic degree of Boolean functions
- Fast bitwise implementation of the algebraic normal form transform
Cites Work
- Title not available (Why is that?)
- Vectorial Boolean functions for cryptography
- Title not available (Why is that?)
- On ``bent functions
- Linearity testing in characteristic two
- Constant depth circuits, Fourier transform, and learnability
- Title not available (Why is that?)
- Spectral domain analysis of correlation immune and resilient Boolean functions
- Computing the Weight of a Boolean Function from Its Algebraic Normal Form
- Title not available (Why is that?)
- Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function
Cited In (3)
This page was built for publication: Computing Walsh coefficients from the algebraic normal form of a Boolean function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458740)
