BSM
COLLOQUIUM   LECTURE
     Professor
       LAJOS RÓNYAI
   (Computer and Automation Institue, HAS and
Budapest University of Technology and Economics)
is going to give a talk
 
Primes are in P: a fast deterministic primality test
The colloquium is on
 THURSDAY, September 25th, 16:15
in room  102


ALL WELCOME!
 

Abstract:  Testing large integers for primality is an important problem from the perspective of secure communication. Satisfactory
randomised algorithms have been available to solve the problem, but it was open until Aug, 2002 wether the problem can be solved
efficiently without resorting to randomization.

Then Indian researchers, M. Agrawal, N. Kayal and N. Saxena proposed an exciting and surprisingly elementary deterministic
algorithm to tell primes from composite numbers.

The objective of the talk is to give a sketch of the AKS-algorithm and discuss some of the mathematics behind it.