| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777316 | Electronic Notes in Discrete Mathematics | 2017 | 8 Pages |
Abstract
We investigate pseudorandom number generators based on block ciphers in counter mode of operation. An idealized abstraction is applied which models the block cipher as a random permutation. We computed the number of output sequences of the idealized generators and estimated the conditional probability for the next symbol to appear given a prefix. In particular, we computed lower and upper bounds for that conditional probability.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alexey Urivskiy, Andrey Rybkin, Mikhail Borodin,