홈 editorial content online
Volume 14 (2012)
No 1
Volume 13 (2011)
No 1
Volume 12 (2010)
No 1
Volume 11 (2009)
No 1, No 2
Volume 10 (2008)
No 1, No 2
Volume 9 (2006)
No 1, No 2
Volume 8 (2005)
No 1, No 2
Volume 7 (2004)
No 1, No 2
Volume 6 (2003)
No 1, No 2
Volume 5 (2002)
No 1, No 2
Volume 4 (2001)
No 1, No 2
Volume 3 (2000)
No 1
Volume 2 (1999)
No 1
Volume 1 (1998)
No 1

(2005 / vol.8 / no.1)
Security frameworks for pseudorandom number generators
Ju-Sung Kang
Pages. 1-11     



In the cryptographic system a pseudorandom number generator is one
of the basic primitives. We survey theoretically secure
pseudorandom bit generators which are provably secure under
certain reasonable number theoretic assumptions and some practical
pseudorandom number generators based on assumptions about
symmetric crypto-primitives. Recently, there was a noticeable
result for the concrete security analysis of pseudorandom number
generators used in practice. Thus we have a closer look on the
Desai-Hevia-Yin's security framework and consider the provable
security for some practical pseudorandom number generators.



1. Introduction
2. Theoretically-secure PRBGs
3. Practical PRNGs
4. Security framework for practical PRNGs
5. Conclusion