Design of combiners to prevent divide and conquer attacks
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
Encryption Schemes for Computer Confidentiality
IEEE Transactions on Computers
A spectral characterization of correlation-immune combining functions
IEEE Transactions on Information Theory
Correlation Attacks on Clock-Controlled Shift Registers in Keystream Generators
IEEE Transactions on Computers
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton
IEEE Transactions on Computers
| Hi-index | 0.01 |
It is known that for a memoryless mapping from GF(2)N into GF(2) the nonlinear order of the mapping and its correlation-immunity form a linear tradeoff. In this paper it is shown that the same tradeoff does no longer hold when the function is allowed to have memory. Moreover, it is shown that integer addition, when viewed over GF(2), defines an inherently nonlinear function with memory whose correlation-immunity is maximum. The summation generator which sums N binary sequences over the integers is shown as an application of integer addition in random sequence generation.