Computer Science – Cryptography and Security
Scientific paper
2011-11-14
Computer Science
Cryptography and Security
Scientific paper
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.
Anashin Vladimir
Khrennikov Andrei
Yurova Ekaterina
No associations
LandOfFree
T-functions revisited: New criteria for bijectivity/transitivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with T-functions revisited: New criteria for bijectivity/transitivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and T-functions revisited: New criteria for bijectivity/transitivity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-216604