2000 character limit reached
T-functions revisited: New criteria for bijectivity/transitivity
Published 14 Nov 2011 in cs.CR and math.DS | (1111.3093v2)
Abstract: 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 ergodic theory: Both the criteria and algorithm use van der Put series to represent 1-Lipschitz $p$-adic functions and to study measure-preservation/ergodicity of these.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.