Fast generation of primes

From: Jacob Jensen (jacob_news_dkNoSpaaaammmm_at_yahoo.co.uk)
Date: 03/30/04 

Date: Tue, 30 Mar 2004 00:28:44 +0200

Hi

I was wondering if anyone knows if in practice, it is needed to be able to
generate primes faster and faster, rather than accept the complexity of the
Miller Rabin test, and live with it. My question is in other words if it is
an important
factor that we can generate primes fast. Are there any concrete real life
examples of cases where we need to generate primes very fast (as fast as the
Miller-Rabin test can generate them)? I would assume a process where we need
to generate many primes in a limited amount of time. But does that ever
occur in real life?

Thank you very much in advance
Jacob