4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DM2014★ 2 cited
A Discrete Logarithm-based Approach to Compute Low-Weight Multiples of Binary Polynomials
P. Peterlongo, M. Sala, C. Tinnirello
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known g…
math.DS2008★ 4 cited
Long hitting time, slow decay of correlations and arithmetical properties
Stefano Galatolo, Pietro Peterlongo
Let be the time needed for a point to enter for the first time in a ball centered in , with small radius . We construct a class of translations…