|
" Primality testing for beginners / "
Lasse Rempe-Gillen, Rebecca Waldecker
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
637283
|
| Doc. No
|
:
|
dltt
|
| Uniform Title
|
:
|
Primzahltests für Einsteiger.English
|
| Main Entry
|
:
|
Rempe-Gillen, Lasse,1978-
|
| Title & Author
|
:
|
Primality testing for beginners /\ Lasse Rempe-Gillen, Rebecca Waldecker
|
| Series Statement
|
:
|
Student mathematical library ;; volume 70
|
| Page. NO
|
:
|
xii, 244 pages ;; 22 cm
|
| ISBN
|
:
|
9780821898833 (alk. paper)
|
|
|
:
|
: 0821898833 (alk. paper)
|
| Notes
|
:
|
Translation of: Primzahltests für Einsteiger : Zahlentheorie - Algorithmik - Kryptographie
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index
|
| Contents
|
:
|
Machine generated contents note: ch. 1 Natural numbers and primes -- 1.1.The natural numbers -- 1.2.Divisibility and primes -- 1.3.Prime factor decomposition -- 1.4.The Euclidean algorithm -- 1.5.The Sieve of Eratosthenes -- 1.6.There are infinitely many primes -- Further reading -- ch. 2 Algorithms and complexity -- 2.1.Algorithms -- 2.2.Decidable and undecidable problems -- 2.3.Complexity of algorithms and the class P -- 2.4.The class NP -- 2.5.Randomized algorithms -- Further reading -- ch. 3 Foundations of number theory -- 3.1.Modular arithmetic -- 3.2.Fermat's Little Theorem -- 3.3.A first primality test -- 3.4.Polynomials -- 3.5.Polynomials and modular arithmetic -- Further reading -- ch. 4 Prime numbers and cryptography -- 4.1.Cryptography -- 4.2.RSA -- 4.3.Distribution of primes -- 4.4.Proof of the weak prime number theorem -- 4.5.Randomized primality tests -- Further reading -- ch. 5 The starting point: Fermat for polynomials -- 5.1.A generalization of Fermat's Theorem -- 5.2.The idea of the AKS algorithm -- 5.3.The Agrawal-Biswas test -- ch. 6 The theorem of Agrawal, Kayal, and Saxena -- 6.1.Statement of the theorem -- 6.2.The idea of the proof -- 6.3.The number of polynomials in P -- 6.4.Cyclotomic polynomials -- ch. 7 The algorithm -- 7.1.How quickly does the order of n modulo r grow? -- 7.2.The algorithm of Agrawal, Kayal, and Saxena -- 7.3.Further comments -- Further reading -- Further reading
|
| Subject
|
:
|
Number theory
|
| Dewey Classification
|
:
|
512.7/2
|
| LC Classification
|
:
|
QA241.R45813 2014
|
| Added Entry
|
:
|
Waldecker, Rebecca,1979-
|
| |