Summary: Is n a Prime Number?
Manindra Agrawal
IIT Kanpur
March 27, 2006, Delft
Manindra Agrawal (IIT Kanpur) Is n a Prime Number? March 27, 2006, Delft 1 / 47
Overview
1 The Problem
2 Two Simple, and Slow, Methods
3 Modern Methods
4 Algorithms Based on Factorization of Group Size
5 Algorithms Based on Fermat's Little Theorem
6 An Algorithm Outside the Two Themes
Manindra Agrawal (IIT Kanpur) Is n a Prime Number? March 27, 2006, Delft 2 / 47
Outline
1 The Problem
2 Two Simple, and Slow, Methods
3 Modern Methods
4 Algorithms Based on Factorization of Group Size
5 Algorithms Based on Fermat's Little Theorem
6 An Algorithm Outside the Two Themes

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

Collections: Computer Technologies and Information Sciences