Adobe PDF
(491.72 kB)
| Title Details: | |
|
Groups - Rings - Polynomials |
|
| Authors: |
Poulakis, Dimitrios |
| Reviewer: |
Tzanakis, Nikolaos |
| Subject: | MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY > COMPUTATIONAL NUMBER THEORY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INFORMATION ASSURANCE AND SECURITY > CRYPTOGRAPHY |
| Description: | |
| Abstract: |
In this chapter we describe some claasical primality tests based on the theorems of Lucas, Pocklington, Fermat, Solovay-Strassen and Miller-Rabin. Finally, we shall study the AKS algorithm which has been invented by The Indian Mathematiciens M. Agrawal, N. Kayal and N. Saxena, and is the first determinist polynomial time algorithm for testing whether or not a positive integer is prime.
|
| Technical Editors: |
Karakostas, Anastasios |
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| Handle | http://hdl.handle.net/11419/1049 |
| Bibliographic Reference: | Poulakis, D. (2015). Groups - Rings - Polynomials [Chapter]. In Poulakis, D. 2015. Computational Number Theory [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/1049 |
| Language: |
Greek |
| Is Part of: |
Computational Number Theory |
| Number of pages |
31 |
| Publication Origin: |
Kallipos, Open Academic Editions |