Computer Science – Cryptography and Security
Scientific paper
2004-01-29
"Applied Algebraic Dynamics", volume 49 of de Gruyter Expositions in Mathematics, 2009, 269-304
Computer Science
Cryptography and Security
Submitted
Scientific paper
The paper study counter-dependent pseudorandom generators; the latter are generators such that their state transition function (and output function) is being modified dynamically while working: For such a generator the recurrence sequence of states satisfies a congruence $x_{i+1}\equiv f_i(x_i)\pmod{2^n}$, while its output sequence is of the form $z_{i}=F_i(u_i)$. The paper introduces techniques and constructions that enable one to compose generators that output uniformly distributed sequences of a maximum period length and with high linear and 2-adic spans. The corresponding stream chipher is provably strong against a known plaintext attack (up to a plausible conjecture). Both state transition function and output function could be key-dependent, so the only information available to a cryptanalyst is that these functions belong to some (exponentially large) class. These functions are compositions of standard machine instructions (such as addition, multiplication, bitwise logical operations, etc.) The compositions should satisfy rather loose conditions; so the corresponding generators are flexible enough and could be easily implemented as computer programs.
No associations
LandOfFree
Pseudorandom number generation by $p$-adic ergodic transformations 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 Pseudorandom number generation by $p$-adic ergodic transformations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudorandom number generation by $p$-adic ergodic transformations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-533275