On the arithmetic Walsh coefficients of Boolean functions

DOI10.1007/s10623-013-9915-3zbMath1308.94120OpenAlexW2017986231MaRDI QIDQ398933

Claude Carlet, Andrew Klapper

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-013-9915-3

zbMATH Keywords

Boolean functionPoisson summation formularesiliencearithmetic Walsh transform

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Boolean functions (94D10)

Related Items (1)

On equations of finite fields of characteristic 2 and APN functions

Cites Work

• A matrix approach for FCSR automata
• Gaussian elimination is not optimal
• Arithmetic Walsh Transform of Quadratic Boolean Functions
• Algebraic Shift Register Sequences
• Arithmetic Correlations and Walsh Transforms
• Arithmetic codes with large distance
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the arithmetic Walsh coefficients of Boolean functions