A Computational Perspective on Pseudorandomness<BR>

<p>
Akinori Kawachi<BR>
Tokyo Institute of Technology, Japan<BR>
 
<P>
Pseudorandomness is an important notion in a wide range of areas,
including physics, computer science, etc.
By recent results in theoretical computer science,
it turned out that the pseudorandomness is deeply
related to the notion of computational hardness.
In this talk, we focus on the relation
with applications to cryptography and randomized algorithms.