Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Asymptotic behaviour ...
Article

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation

Philippe Dumas ORCID (1), Helger Lipmaa ORCID (2) (3), Johan Wallén (4)
(1) Algorithms
(2) University of Tartu
(3) Tartu University Hospital
(4) Laboratory for Theoretical Computer Science [Espoo]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:1
Analysis of Algorithms
DOI
10.46298/dmtcs.399
License
https://about.hal.science/hal-authorisation-v1
Indicators
840
Views
967
Downloads

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation

Philippe Dumas ORCID (1), Helger Lipmaa ORCID (2) (3), Johan Wallén (4)
(1) Algorithms
(2) University of Tartu
(3) Tartu University Hospital
(4) Laboratory for Theoretical Computer Science [Espoo]
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Asymptotic Analysis of Regular Sequences

    Algorithmica

    Authors : Clemens Heuberger ORCID, Daniel Krenn ORCID

    Journal reference : Volume 82, 2019, pp. 429-508

    DOI : 10.1007/s00453-019-00631-3
Preview
Loading PDF preview...