PRIMES is in P

Page Content

Samuel S. Wagstaff, Jr. - CERIAS

Feb 12, 2003

PDF Slides PDF ()

Abstract

On August 6, 2002, Manindra Agrawal, Neeraj Kayal, and Nitin Saxena
of the Indian Institute of Technolgy in Kanpur announced that there
is a deterministic polynomial-time algorithm for testing whether
a number is prime or composite.

Their paper is available at: http://www.cse.iitk.ac.in/primality.pdf

We will explain what this terminology means, why we should care,
what was known before their work, and what their new algorithm is.

Unless otherwise noted, the security seminar is held on Wednesdays at 4:30P.M. STEW G52, West Lafayette Campus. More information...

© 1999-2013 Purdue University. All rights reserved.

Use/Reuse Guidelines

CERIAS Seminar materials are intended for educational, non-commercial use only and any or all commercial use is prohibited. Any use must attribute "The CERIAS Seminar at Purdue University." Opinions expressed in the recordings are not necessarily representative of the views of CERIAS or of Purdue University.