In this paper, we present some major algorithmic improvements to fast correlation attacks. In previous articles about fast correlations , algorithmics never was the main topic. Instead, the authors of these articles were usually addressing theoretical issues in order to get better attacks. This viewpoint has produced a long sequence of increasingly… (More)
We analyse asymptotically performances and convergence of fast iterative correlation attacks for the cryptanalysis of stream ciphers using linear feedback shift registers as autonomous stages. Finally, we describe and analyse an improvement for this class of cryptanalytical algorithms.
We prove a new sufficient condition for a Boolean function to be extremal balanced or maximally nonlinear, in odd or even dimension. Under this condition, we deduce the balanced covering radius ρ B (n) and the covering radius ρ(n). We prove some general properties about maximally nonlinear or extremal balanced functions. Finally, an application to even… (More)