Paper 2011/130

Ergodic Theory Over ${\F}_2[[T]]$

Dongdai Lin, Tao Shi, and Zifeng Yang

Abstract

In cryptography and coding theory, it is important to study the pseudo-random sequences and the ergodic transformations. We already have the $1$-Lipshitz ergodic theory over ${\Z}_2$ established by V. Anashin and others. In this paper we present an ergodic theory over ${\F}_2[[T]]$ and some ideas which might be very useful in applications.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
pseudo-randomnessergodic
Contact author(s)
ddlin @ is iscas ac cn
shitao @ is iscas ac cn
yangzf @ mail cnu edu cn
History
2011-03-18: received
Short URL
https://ia.cr/2011/130
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/130,
      author = {Dongdai Lin and Tao Shi and Zifeng Yang},
      title = {Ergodic Theory Over ${\F}_2[[T]]$},
      howpublished = {Cryptology ePrint Archive, Paper 2011/130},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/130}},
      url = {https://eprint.iacr.org/2011/130}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.