-1

There are some PRNGs considered cryptographically secure. Which has the longest period among them?

IPRNG
  • 59
  • 3

1 Answers1

2

Number-theoretic PRNGs such as Blum-Blum-Shub can be given arbitrarily long periods by choosing sufficiently large parameters. In the case of BBS, the period is $\lambda(M)$ where $M$ is the modulus and $\lambda$ is the Carmichael function, which has no maximum value.

Daniel Franke
  • 361
  • 1
  • 11