Algorithms for primes

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=IaaLeQ-0CLE


Duration: 1:14:08
3,311 views
31

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').



Other Videos By Microsoft Research


2016-08-17System Software Support for GPU-accelerated Applications
2016-08-17Contribution Games in Social Networks
2016-08-17Optically Sensing Tongue Gestures for Computer Input
2016-08-17ECM -- Then and Now
2016-08-17Fast and Accurate Arc Filtering for Dependency Parsing
2016-08-17Breaking ECC2K-130
2016-08-17Atkin-Swinnerton-Dyer Congruences on Noncongruence Modular Forms
2016-08-17Solvency Games
2016-08-17How to be a UAV pilot with just 3 minutes of training and a smartphone
2016-08-17Composition Laws
2016-08-17Algorithms for primes
2016-08-17Computing genus 2 curves from invariants on the Hilbert moduli space
2016-08-17Supporting Families through a Recession and Ending Homelessness in Our Community
2016-08-172010 Microsoft Research eScience Workshop - Data Visualization using WorldWide Telescope
2016-08-17How to fool people to work on circuit lower bounds
2016-08-17Pairing-based proof systems and applications to anonymous credentials
2016-08-17F4 Traces and Index Calculus on Elliptic Curves Over Extension Fields
2016-08-17Generalizing Vélu's formulas and some applications
2016-08-17Igusa class polynomials, embeddings of quartic CM fields, and arithmetic intersection theory
2016-08-17ECC on constrained devices
2016-08-17The Return of Wolves to Washington


Tags:
microsoft research