Periodic Structure of the Exponential Pseudorandom Number Generator
arXiv:1312.1311v12 citations
Originality Synthesis-oriented
AI Analysis
This work addresses a theoretical problem in cryptography and number theory for researchers, but it appears incremental as it builds on known generators.
The paper tackles the problem of analyzing the periodic structure of an exponential pseudorandom number generator based on the map x -> g^x mod p, and it presents results on its properties, though no concrete numbers are provided in the abstract.
We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map $x\mapsto g^x\pmod p$ that acts on the set $\{1, \ldots, p-1\}$.