Muutke küpsiste eelistusi

E-raamat: Joy of Factoring

Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 64,97 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book is about the theory and practice of integer factorisation presented in a historic perspective. It describes about twenty algorithms for factoring and a dozen other number theory algorithms that support the factoring algorithms. Most algorithms are described both in words and in pseudocode to satisfy both number theorists and computer scientists.

Each of the ten chapters begins with a concise summary of its contents. The book starts with a general explanation of why factoring integers is important. The next two chapters present number theory results that are relevant to factoring. Further on there is a chapter discussing, in particular, mechanical and electronic devices for factoring, as well as factoring using quantum physics and DNA molecules. Another chapter applies factoring to breaking certain cryptographic algorithms. Yet another chapter is devoted to practical vs. theoretical aspects of factoring. The book contains more than 100 examples illustrating various algorithms and theorems. It also contains more than 100 interesting exercises to test the reader's understanding. Hints or answers are given for about a third of the exercises. The book concludes with a dozen suggestions of possible new methods for factoring integers.

This book is written for readers who want to learn more about the best methods of factoring integers, many reasons for factoring, and some history of this fascinating subject. It can be read by anyone who has taken a first course in number theory.

Arvustused

It is, I think, a fairly safe bet that most students learning about factoring do not instinctively view the subject as having anything whatsoever to do with 'joy'. ... [ B]y contrast, most people (even many math students) equate factoring with tedium. Consequently, anybody setting out to write a book entitled The Joy of Factoring is automatically faced with a double objective. The author must not only teach the reader something about factoring, but must also explain why anybody should care. The book under review succeeds on both counts. ... I think a second course in number theory, or senior seminar, based on this book would be quite interesting. ... The book could also be used as a text for an upper-level course in computer science for students with some background in number theory. It also certainly belongs in any good university library, if only because the material collected in it is not (to my knowledge at any rate) readily available in the textbook literature." - Mark Hunacek, MAA Reviews

"This work is a pleasure to read; it is a must for anyone interested in numbers, programming, and codes. The extensive bibliography gives readers direction and the tools to quickly delve deeper into the field. ... Highly recommended." - CHOICE

Preface ix
Exercise xiv
Chapter 1 Why Factor Integers?
1(12)
Introduction
1(1)
§1.1 Public-Key Cryptography
2(3)
§1.2 Repunits
5(1)
§1.3 Repeating Decimal Fractions
6(2)
§1.4 Perfect Numbers
8(1)
§1.5 The Cunningham Project
9(4)
Exercises
12(1)
Chapter 2 Number Theory Review
13(28)
Introduction
13(4)
§2.1 Divisibility
17(3)
§2.2 Prime Numbers
20(4)
§2.3 Congruences
24(4)
§2.4 Fermat and Euler
28(5)
§2.5 Arithmetic Functions
33(3)
§2.6 Quadratic Congruences
36(5)
Exercises
39(2)
Chapter 3 Number Theory Relevant to Factoring
41(34)
Introduction
41(1)
§3.1 Smooth Numbers
42(2)
§3.2 Finding Modular Square Roots
44(3)
§3.3 Cyclotomic Polynomials
47(2)
§3.4 Divisibility Sequences and bm -- 1
49(6)
§3.5 Factors of bm + 1
55(1)
§3.6 Factors of Fibonacci and Lucas Numbers
56(3)
§3.7 Primality Testing
59(16)
Exercises
71(4)
Chapter 4 How Are Factors Used?
75(44)
Introduction
75(1)
§4.1 Aurifeuillian Factorizations
76(7)
§4.2 Perfect Numbers
83(5)
§4.3 Harmonic Numbers
88(3)
§4.4 Prime Proving
91(2)
§4.5 Linear Feedback Shift Registers
93(4)
§4.6 Testing Conjectures
97(4)
§4.7 Bernoulli Numbers
101(3)
§4.8 Cryptographic Applications
104(9)
§4.9 Other Applications
113(6)
Exercises
116(3)
Chapter 5 Simple Factoring Algorithms
119(24)
Introduction
119(1)
§5.1 Trial Division
120(3)
§5.2 Fermat's Difference of Squares Method
123(4)
§5.3 Hart's One-Line Factoring Algorithm
127(1)
§5.4 Lehman's Variation of Fermat
128(4)
§5.5 The Lehmers' Factoring Method
132(3)
§5.6 Pollard's Rho Method
135(3)
§5.7 Pollard's p -- 1 Method
138(5)
Exercises
141(2)
Chapter 6 Continued Fractions
143(30)
Introduction
143(1)
§6.1 Basic Facts about Continued Fractions
144(3)
§6.2 McKee's Variation of Fermat
147(2)
§6.3 Periodic Continued Fractions
149(4)
§6.4 A General Plan for Factoring
153(2)
§6.5 Lehmer and Powers
155(3)
§6.6 Continued Fraction Factoring Algorithm
158(5)
§6.7 SQUFOF---SQUare FOrms Factoring
163(6)
§6.8 Pell's Equation
169(4)
Exercises
170(3)
Chapter 7 Elliptic Curves
173(18)
Introduction
173(1)
§7.1 Basic Properties of Elliptic Curves
174(7)
§7.2 Factoring with Elliptic Curves
181(6)
§7.3 Primality Proving with Elliptic Curves
187(1)
§7.4 Applications of Factoring to Elliptic Curves
188(3)
Exercises
190(1)
Chapter 8 Sieve Algorithms
191(28)
Introduction
191(1)
§8.1 The Basic Sieve
192(3)
§8.2 The Quadratic Sieve
195(7)
§8.3 The Double Sieve
202(3)
§8.4 Schroeppel's Linear Sieve
205(2)
§8.5 The Number Field Sieve
207(12)
Exercises
217(2)
Chapter 9 Factoring Devices
219(20)
Introduction
219(1)
§9.1 Sieve Devices
219(11)
§9.2 Special Computers
230(9)
Exercise
237(2)
Chapter 10 Theoretical and Practical Factoring
239(34)
Introduction
239(1)
§10.1 Theoretical Factoring
240(4)
§10.2 Multiprecise Arithmetic
244(2)
§10.3 Factoring---There's an App for That
246(2)
§10.4 Dirty Tricks
248(5)
§10.5 Dirty Tricks with Lattices
253(9)
§10.6 The Future of Factoring
262(7)
Exercises
267(2)
Appendix. Answers and Hints for Exercises
269(1)
Introduction
269(1)
§A.1
Chapter 1
269(1)
§A.2
Chapter 2
270(1)
§A.3
Chapter 3
270(1)
§A.4
Chapter 4
271(1)
§A.5
Chapter 5
271(1)
§A.6
Chapter 6
271(1)
§A.7
Chapter 7
272(1)
§A.8
Chapter 8
272(1)
§A.9
Chapter 10
272(1)
Bibliography 273(14)
Index 287
Samuel S. Wagstaff, Jr., Purdue University, West Lafayette, IN, USA