New Baselines for Local Pseudorandom Number Generators by Field Extensions

ePrint Report: New Baselines for Local Pseudorandom Number Generators by Field Extensions

Akın Ünal

We will revisit recent techniques and results on the cryptoanalysis of local pseudorandom number generators (PRGs). By doing so, we will achieve a new attack on PRGs whose time complexity only depends on the algebraic degree of the PRG.


Concretely, against PRGs $F : \{0,1\}^n\rightarrow \{0,1\}^{n^{1+e}}$ we will give an algebraic attack whose time complexity is bounded by
\[\exp(O(\log(n)^{\deg F /(\deg F - 1)} \cdot n^{1-e/(\deg …

attack baselines complexity doing eprint report extensions local log report results techniques