This paper investigates a probabilistic algebraic attack on LFSR-based stream ciphers. We consider two scenarios (S3a and S3b) proposed by Meier et al. at Eurocrypt 2004. In order to derive the probability in this new algebraic attack, we quantify the distance between a Boolean function and a function with annihilator of a certain degree. We show that in some cases the approximations can improve the algebraic attacks. Moreover, this distance leads to other theoretical results such as the weights of the subfunctions and the distance to normal functions; it also provides information on the Walsh spectrum of the function. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Braeken, A., & Preneel, B. (2005). Probabilistic algebraic attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3796 LNCS, pp. 290–303). https://doi.org/10.1007/11586821_20
Mendeley helps you to discover research relevant for your work.