A New Representation of Boolean Functions

Authors:
Claude Carlet;Philippe Guillot
Affiliations:
-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 3
Cited 2

Nonlinearity criteria for cryptographic functions

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A characterization of binary bent functions

Journal of Combinatorial Theory Series A
Generalized partial spreads

IEEE Transactions on Information Theory

p-Ary and q-ary versions of certain results about bent functions and resilient functions

Finite Fields and Their Applications
Computing the weight of a boolean function from its algebraic normal form

SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a representation of Boolean functions (and more generally of integer-valued / complex-valued functions), not used until now in coding and cryptography, which yields more information than the currently known representations, on the combinatorial, spectral and cryptographic properties of the functions.