Abstract
We generalize to the arithmetic Walsh transform (AWT) some results which were previously known for the Walsh–Hadamard transform of Boolean functions. We first generalize the classical Poisson summation formula to the AWT. We then define a generalized notion of resilience with respect to an arbitrary statistical measure of Boolean functions. We apply the Poisson summation formula to obtain a condition equivalent to resilience for one such statistical measure. Last, we show that the AWT of a large class of Boolean functions can be expressed in terms of the AWT of a Boolean function of algebraic degree at most three in a larger number of variables.
Similar content being viewed by others
Notes
Since we sometimes treat Boolean values as integers, it is helpful to indicate when we want to reduce an expression involving such values modulo 2.
References
Arnault F., Berger T., Pousse B.: A matrix approach for FCSR automata. Cryptogr. Commun. 3(2), 109–139 (2011).
Carlet C.: A transformation on boolean functions, its consequences on some problems related to Reed-Muller codes. In: Cohen G., Charpin P. (eds.) EUROCODE’90. Lecture Notes in Computer Science, vol. 514, pp. 42–50. Springer, Berlin, Heidelberg (1991).
Carlet C.: Boolean functions for cryptography and error correcting codes. In: Crama Y., Hammer P. (eds.) Boolean Methods and Models, pp. 257–397. Cambridge University Press, Cambridge. http://www.math.univ-paris13.fr/~carlet/pubs.html (2010).
Goresky M., Klapper A.: Algebraic Shift Register Sequences. Cambridge University Press, Cambridge (2012).
Klapper A.: Arithmetic Walsh transform of quadratic boolean functions (extended abstract). In: Helleseth T., Jedwab J. (eds.), Sequences and Their Applications—SETA 2012. Lecture Notes in Computer Science, vo. 7280, pp. 65–76 (2012).
Klapper A., Goresky M.: Arithmetic correlations and Walsh transforms. IEEE Trans. Inf. Theory 58, 479–492 (2012).
Lidl R., Niederreiter H.: Finite Fields in Encyclopedia of Mathematics, vol. 20. Cambridge University Press, Cambridge (1983).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977).
Mandelbaum D.: Arithmetic codes with large distance. IEEE Trans. Inf. Theory 13, 237–242 (1967).
Rao T.R.N.: Error Coding for Arithmetic Processors. Academic Press, New York (1974).
Strassen V.: Gaussian elimination is not optimal. Numer. Math. 13, 354–356 (1969).
Acknowledgments
This material is based upon work supported by the National Science Foundation under Grant No. CCF-0514660. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.
Rights and permissions
About this article
Cite this article
Carlet, C., Klapper, A. On the arithmetic Walsh coefficients of Boolean functions. Des. Codes Cryptogr. 73, 299–318 (2014). https://doi.org/10.1007/s10623-013-9915-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-013-9915-3