A Brief Outline of Research on Correlation Immune Functions
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Construction of Cryptographically Important Boolean Functions
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Evolving Boolean Functions Satisfying Multiple Criteria
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Discrete Applied Mathematics - Special issue: Coding and cryptography
An evolutionary multiobjective approach to design highly non-linear Boolean functions
Proceedings of the 9th annual conference on Genetic and evolutionary computation
On the existence of (10, 2, 7, 488) resilient functions
IEEE Transactions on Information Theory
Discrete Applied Mathematics - Special issue: Coding and cryptography
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Boolean functions optimizing most of the cryptographic criteria
Discrete Applied Mathematics
Characterisations of extended resiliency and extended immunity of s-boxes
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Constructions of 1-resilient Boolean functions on odd number of variables with a high nonlinearity
Security and Communication Networks
Counting Boolean functions with specified values in their Walsh spectrum
Journal of Computational and Applied Mathematics
| Hi-index | 754.90 |
One well-known method of generating key stream sequences for stream ciphers is to combine the outputs of several linear-feedback shift registers (LFSR) using a combining Boolean function. Here we concentrate on the design of good combining Boolean functions. We provide resilient Boolean functions with currently best known nonlinearity. These functions were not known earlier and the issues related to their existence were posed as open questions in the literature. Some of the functions we construct here achieve the provable upper bound on nonlinearity for resilient Boolean functions. Our technique interlinks mathematical results with classical computer search