Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Algorithms for primes

Speaker  Daniel J. Bernstein

Affiliation  University of Illinois at Chicago

Host  Kristin Lauter

Duration  01:13:45

Date recorded  21 October 2010

This talk will consist of a series of light mini-talks inspired by Atkin's papers on recognizing primes (1982, "On a primality test of Solovay and Strassen"; 1995, "Intelligent primality test offer"), proving primes to be prime (1993, "Elliptic curves and primality proving"), factoring integers into primes (1993, "Finding suitable curves for the elliptic curve method of factorization"), and enumerating primes (2004, "Prime sieves using binary quadratic forms").

©2010 Microsoft Corporation. All rights reserved.
By the same speaker
People also watched
> Algorithms for primes