• Home
• Mission
• Research ⊕
  • Highlights
  • Secure Distributed Computation
  • Abstract Crypto
  • Public-Key Crypto
  • Symmetric Crypto
  • Information-theoretic Crypto
  • Quantum Crypto ⊕
    • Physics in Crypto
  • Public-Key Infrastructures
  • Zero-Knowledge
  • Complexity Theory ⊕
    • Role in Cryptography
  • Payment Systems
  • Statistical Randomness Testing
  • Miscellaneaous
• Publications
• Teaching ⊕
  • Theses
  • Information Security 2012
  • Cryptographic Protocols 2012
  • Algorithms, Probability, and Computing 2011
  • Diskrete Mathematik 2011
  • Cryptography 2011
  • Information Security 2011
  • Cryptographic Protocols 2011
• People ⊕
  • Ueli Maurer ⊕
    • Publications
    • Some talks
    • Short CV
    • Contact
  • Martin Hirt ⊕
    • Publications
    • CV
  • Arpita Patra ⊕
    • Publications
  • Divesh Aggarwal ⊕
    • Publications
  • Kfir Barhum ⊕
    • Publications
  • Sandro Coretti
  • Gregory Demay ⊕
    • Publications
  • Peter Gazi ⊕
    • Publications
  • Christoph Lucas ⊕
    • Publications
  • Christian Matt
  • Pavel Raykov
  • Björn Tackmann ⊕
    • Publications
  • Former Members
  • Graduates
• Events ⊕
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
• Links

• Internal 

Thomas Holenstein
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, pp. 443–461, Mar 2006.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]