Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
OK. I have an educated guess: if $f$ is eventually non-periodic, then cipher is not vulnerable to Kasiski's method or frequency analysis. Eg. decimal expansion of $\sqrt{p}$ with base 26 where $p$ is prime.
