Prime numbers and mathematical discovery

Renato Martini
Wed Aug 28 17:34:02 2002

Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit

Hi all:

I read the news just now, and I'm thinking how this will can affect the assimetric
crypto programs...

Indian Institute of Technology (IIT) Kanpur is proud to announce that Professor Manindra Agrawal along with his students Neeraj
      Kayal, and Nitin Saxena, have solved a centuries old open problem of mathematics: they have discovered a polynomial time
      algorithm (i.e. an algorithm that is efficient in terms of time it takes to compute) to test if a given number is prime or not. A prime
      number is a number which cannot be divided evenly by any number other than 1 and itself, for, example 2, 3, 5, .., 97, ... 8191,
      etc.These are the building blocks of all numbers, and scholars since ancient times have been engaged in studying their properties. (...)


best regards


  __|_ _| _ \  __|  __|   \    | Renato Martini ::: Diretor Administrativo
 (     |  __/\__ \ (_ |  _ \   |
\___|___|_|  ____/\___|_/  _\  |
          **Please sign or encrypt for Internet privacy**
"O Fantasia, che dei tempi e delle distanze fai il tuo giuoco audace!"
                         (Gabriele d'Annunzio)

Content-Type: application/pgp-signature

Version: GnuPG v1.0.7 (GNU/Linux)