Authors: Philippe Dumas ¹; Helger Lipmaa ²; Johan Wallén ³

• 1 Algorithms
• 2 University of Tartu
• 3 Laboratory for Theoretical Computer Science [Espoo]

We analyse the asymptotic behaviour in the mean of a non-commutative rational series, which originates from differential cryptanalysis, using tools from probability theory, and from analytic number theory. We derive a Fourier representation of a first-order summation function obtained by interpreting this rational series as a non-classical rational sequence via the octal numeration system. The method is applicable to a wide class of sequences rational with respect to a numeration system essentially under the condition that they admit a linear representation with nonnegative coefficients.