activity
20022015
most citedT-functions revisited: New criteria for bijectivity/transitivity

44 citations · 255 across the 13 of their papers we have counts for

collaborators

13 papers

math.DS2015

Quantization causes waves:Smooth finitely computable functions are affine

Vladimir Anashin

Given an automaton (a letter-to-letter transducer, a dynamical 1-Lipschitz system on the space of -adic integers) whose input and output alphabets ar…

math.DS2012★ 29 cited

Ergodicity criteria for non-expanding transformations of 2-adic spheres

Vladimir Anashin, Andrei Khrennikov, Ekaterina Yurova

In the paper, we obtain necessary and sufficient conditions for ergodicity (with respect to the normalized Haar measure) of discrete dynamical systems o…

cs.FL2011★ 24 cited

Automata finiteness criterion in terms of van der Put series of automata functions

Vladimir Anashin

In the paper we develop the -adic theory of discrete automata. Every automaton (transducer) whose input/output alphabets consist of symbols can be associated t…

math.DS2011★ 26 cited

The Non-Archimedean Theory of Discrete Systems

Vladimir Anashin

In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t…

cs.CR2011

Linear Relation on General Ergodic T-Function

Tao Shi, Vladimir Anashin, Dongdai Lin

We find linear (as well as quadratic) relations in a very large class of T-functions. The relations may be used in analysis of T-function-based stream ciphers.

cs.CR2011★ 44 cited

T-functions revisited: New criteria for bijectivity/transitivity

Vladimir Anashin, Andrei Khrennikov, Ekaterina Yurova

The paper presents new criteria for bijectivity/transitivity of T-functions and fast knapsack-like algorithm of evaluation of a T-function. Our approach is based on non-Archimedean…