Cryptanalysts representation of nonlinearly filtered ML-sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
More correlation-immune and resilient functions over Galois fields and Galois rings
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
SETA '08 Proceedings of the 5th 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
When does G(x )+γTr(H(x)) permute Fpn?
Finite Fields and Their Applications
On some permutation binomials of the form x2n-1/k+1 + ax over f2n: existence and count
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
New families of differentially 4-uniform permutations over F22k
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Side-channel indistinguishability
Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy
| Hi-index | 0.00 |
We study the notionof linear structure of a function defined from \F^mto \F^n, and in particular of a Boolean function.We characterize the existence of linear structures by means ofthe Fourier transform of the function. For Boolean functions,this characterization can be stated in a simpler way. Finally,we give some constructions of resilient Boolean functions whichhave no linear structure.