On Propagation Characteristics of Resilient Functions
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Functions and Design Criteria for Block Ciphers
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Journal of Complexity - Special issue on coding and cryptography
Journal of Complexity - Special issue on coding and cryptography
Piecewise Constructions of Bent and Almost Optimal Boolean Functions
Designs, Codes and Cryptography
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
Designs, Codes and Cryptography
The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd
Journal of Combinatorial Theory Series A
Efficient Algorithm of Affine Form Searching forWeakly Specified Boolean Function
Fundamenta Informaticae
Sequences, DFT and Resistance against Fast Algebraic Attacks
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Construction of bent functions from near-bent functions
Journal of Combinatorial Theory Series A
Information Sciences: an International Journal
Differential properties of power functions
International Journal of Information and Coding Theory
Spectra of Boolean functions, subspaces of matrices, and going up versus going down
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On correctable errors of binary linear codes
IEEE Transactions on Information Theory
On linear hulls, statistical saturation attacks, PRESENT and a cryptanalysis of PUFFIN
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On the link of some semi-bent functions with Kloosterman sums
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
A construction of weakly and non-weakly regular bent functions
Journal of Combinatorial Theory Series A
New cryptographic applications of boolean function equivalence classes
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Geometric and design-theoretic aspects of semibent functions II
Designs, Codes and Cryptography
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On boolean functions with generalized cryptographic properties
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Near bent functions on a hyperplane
Finite Fields and Their Applications
Propagation characteristics of x→ x-1 and Kloosterman sums
Finite Fields and Their Applications
A new class of monomial bent functions
Finite Fields and Their Applications
When does G(x )+γTr(H(x)) permute Fpn?
Finite Fields and Their Applications
Efficient Algorithm of Affine Form Searching forWeakly Specified Boolean Function
Fundamenta Informaticae
Semi-bent functions with multiple trace terms and hyperelliptic curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
| Hi-index | 754.90 |
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