Primality Testing in Polynomial Time: from Randomized Algorithms to Primes Is in P

Primality Testing in Polynomial Time: from Randomized Algorithms to Primes Is in P

Author: M. Dietzfelbinger

Publisher:

Published: 2004

Total Pages: 147

ISBN-13: 9781280307959

DOWNLOAD EBOOK

This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite. The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digits needed to write n, are important for theoretical computer science and for applications in algorithmics and cryptology. This book gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The textbook is written for students of computer science, in particular for those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.


Primality Testing in Polynomial Time

Primality Testing in Polynomial Time

Author: Martin Dietzfelbinger

Publisher: Springer Science & Business Media

Published: 2004-06-29

Total Pages: 153

ISBN-13: 3540403442

DOWNLOAD EBOOK

A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal and Saxena. The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.


Primality Testing for Beginners

Primality Testing for Beginners

Author: Lasse Rempe-Gillen

Publisher: American Mathematical Soc.

Published: 2013-12-11

Total Pages: 258

ISBN-13: 0821898833

DOWNLOAD EBOOK

How can you tell whether a number is prime? What if the number has hundreds or thousands of digits? This question may seem abstract or irrelevant, but in fact, primality tests are performed every time we make a secure online transaction. In 2002, Agrawal, Kayal, and Saxena answered a long-standing open question in this context by presenting a deterministic test (the AKS algorithm) with polynomial running time that checks whether a number is prime or not. What is more, their methods are essentially elementary, providing us with a unique opportunity to give a complete explanation of a current mathematical breakthrough to a wide audience. Rempe-Gillen and Waldecker introduce the aspects of number theory, algorithm theory, and cryptography that are relevant for the AKS algorithm and explain in detail why and how this test works. This book is specifically designed to make the reader familiar with the background that is necessary to appreciate the AKS algorithm and begins at a level that is suitable for secondary school students, teachers, and interested amateurs. Throughout the book, the reader becomes involved in the topic by means of numerous exercises.


An Exposition of the Deterministic Polynomial-time Primality Testing Algorithm of Agrawal-Kayal-Saxena

An Exposition of the Deterministic Polynomial-time Primality Testing Algorithm of Agrawal-Kayal-Saxena

Author: Robert Lawrence Anderson

Publisher:

Published: 2005

Total Pages: 80

ISBN-13:

DOWNLOAD EBOOK

I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.


The Riemann Hypothesis

The Riemann Hypothesis

Author: Peter B. Borwein

Publisher: Springer Science & Business Media

Published: 2008

Total Pages: 543

ISBN-13: 0387721258

DOWNLOAD EBOOK

The Riemann Hypothesis has become the Holy Grail of mathematics in the century and a half since 1859 when Bernhard Riemann, one of the extraordinary mathematical talents of the 19th century, originally posed the problem. While the problem is notoriously difficult, and complicated even to state carefully, it can be loosely formulated as "the number of integers with an even number of prime factors is the same as the number of integers with an odd number of prime factors." The Hypothesis makes a very precise connection between two seemingly unrelated mathematical objects, namely prime numbers and the zeros of analytic functions. If solved, it would give us profound insight into number theory and, in particular, the nature of prime numbers. This book is an introduction to the theory surrounding the Riemann Hypothesis. Part I serves as a compendium of known results and as a primer for the material presented in the 20 original papers contained in Part II. The original papers place the material into historical context and illustrate the motivations for research on and around the Riemann Hypothesis. Several of these papers focus on computation of the zeta function, while others give proofs of the Prime Number Theorem, since the Prime Number Theorem is so closely connected to the Riemann Hypothesis. The text is suitable for a graduate course or seminar or simply as a reference for anyone interested in this extraordinary conjecture.


Randomized Algorithms

Randomized Algorithms

Author: Rajeev Motwani

Publisher: Cambridge University Press

Published: 1995-08-25

Total Pages: 496

ISBN-13: 9780521474658

DOWNLOAD EBOOK

This book presents basic tools from probability theory used in algorithmic applications, with concrete examples.


Design and Analysis of Algorithms

Design and Analysis of Algorithms

Author: Parag H. Dave

Publisher: Pearson Education India

Published: 2007-09

Total Pages: 836

ISBN-13: 9788177585957

DOWNLOAD EBOOK

"All aspects pertaining to algorithm design and algorithm analysis have been discussed over the chapters in this book-- Design and Analysis of Algorithms"--Resource description page.


Primality Testing and Integer Factorization in Public-Key Cryptography

Primality Testing and Integer Factorization in Public-Key Cryptography

Author: Song Y. Yan

Publisher: Springer Science & Business Media

Published: 2009-04-03

Total Pages: 386

ISBN-13: 0387772685

DOWNLOAD EBOOK

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test.


Prime Numbers

Prime Numbers

Author: Richard Crandall

Publisher: Springer Science & Business Media

Published: 2006-04-07

Total Pages: 597

ISBN-13: 0387289798

DOWNLOAD EBOOK

Bridges the gap between theoretical and computational aspects of prime numbers Exercise sections are a goldmine of interesting examples, pointers to the literature and potential research projects Authors are well-known and highly-regarded in the field