On cryptographic properties of the cosets of R(1, m)

2001/05/01 by Anne Canteaut, A. Canteaut, Claude Carlet +5 · 7 citations
Computer Science · Engineering · #Coding theory and cryptography #Chaos-based Image/Signal Encryption #graph theory and CDMA systems

paper · doi:10.1109/18.923730

Abstract

We introduce a new approach for the study of weight distributions of cosets of the Reed-Muller code of order 1. Our approach is based on the method introduced by Kasami (1968), using Pless (1963) identities. By interpreting some equations, we obtain a necessary condition for a coset to have a "high" minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We then apply our results to the problem of the nonlinearity of Boolean functions. We particularly study the links between this criterion and the propagation characteristics of a function.

Cited by

• Several new classes of Boolean functions with few Walsh transform values
• On the Codebook Design for NOMA Schemes from Bent Functions
• Graphs of vectorial plateaued functions as difference sets
• Reed-Muller Codes Achieve Capacity on Erasure Channels
• ℤ_q-valued generalized bent functions in odd characteristics
• Plateaued functions and one-and-half difference sets
• On the normality of p -ary bent functions. [europepmc]

Related

• On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code
• Relative generalized Hamming weights of q-ary Reed-Muller codes
• Computing the Weight Distribution of the Binary Reed-Muller Code \mathcal R (4,9)
• Reed-Muller Codes: Theory and Algorithms
• Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code