Learn More
Let τr(x, x 0) be the time needed for a point x to enter for the first time in a ball Br(x 0) centered in x 0 , with small radius r. We construct a class of translations on the two torus having particular arithmetic properties (Liou-ville components with intertwined denominators of convergents) not satisfying a logarithm law, i.e. such that for generic x, x(More)
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 general purpose algorithm is based on the generalized birthday problem. We describe an alternative approach which is based on discrete logarithms and has much lower memory(More)
  • 1