 |
|
Session 1. Analytic Number Theory |
Prime Numbers and Cryptography |
| Maciej GrzeĊkowiak, Adam Mickiewicz University, Poland |
|
Algorithms for computing large primes of special forms are important
for various applications in computational number theory and
cryptography. In many cases an analysis of computational complexity
of proposed constructions is connected with the analytic number
theory problems. We outline some algorithms and the related number
theory problems.
|
| Print version |