Algorithmic Number Theory
Lattices, Number Fields, Curves and Cryptography
Herausgeber: Buhler, J. P.; Stevenhagen, P.
Algorithmic Number Theory
Lattices, Number Fields, Curves and Cryptography
Herausgeber: Buhler, J. P.; Stevenhagen, P.
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
An introduction to number theory for beginning graduate students with articles by the leading experts in the field.
Andere Kunden interessierten sich auch für
- Algorithmic Number Theory133,99 €
- Tim RoughgardenTwenty Lectures on Algorithmic Game Theory100,99 €
- Topics in Algorithmic Graph Theory118,99 €
- Neal KoblitzAlgebraic Aspects of Cryptography132,99 €
- Kohtaro TadakiA Statistical Mechanical Interpretation of Algorithmic Information Theory48,99 €
- Computer Algebra Handbook126,99 €
- Gisbert Wustholz (ed.)A Panorama of Number Theory or the View from Baker's Garden128,99 €
-
-
-
An introduction to number theory for beginning graduate students with articles by the leading experts in the field.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 664
- Erscheinungstermin: 31. Januar 2011
- Englisch
- Abmessung: 234mm x 156mm x 35mm
- Gewicht: 992g
- ISBN-13: 9780521208338
- ISBN-10: 0521208335
- Artikelnr.: 35204692
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
- Verlag: Cambridge University Press
- Seitenzahl: 664
- Erscheinungstermin: 31. Januar 2011
- Englisch
- Abmessung: 234mm x 156mm x 35mm
- Gewicht: 992g
- ISBN-13: 9780521208338
- ISBN-10: 0521208335
- Artikelnr.: 35204692
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
1. Solving Pell's equation Hendrik Lenstra
2. Basic algorithms in number theory Joe Buhler and Stan Wagon
3. Elliptic curves Bjorn Poonen
4. The arithmetic of number rings Peter Stevenhagen
5. Fast multiplication and applications Dan Bernstein
6. Primality testing Rene Schoof
7. Smooth numbers: computational number theory and beyond Andrew Granville
8. Smooth numbers and the quadratic sieve Carl Pomerance
9. The number field sieve Peter Stevenhagen
10. Elementary thoughts on discrete logarithms Carl Pomerance
11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
12. Lattices Hendrik Lenstra
13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
14. Protecting communications against forgery Dan Bernstein
15. Computing Arakelov class groups Rene Schoof
16. Computational class field theory Henri Cohen and Peter Stevenhagen
17. Zeta functions over finite fields Daqing Wan
18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
19. How to get your hands on modular forms using modular symbols William Stein
20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.
2. Basic algorithms in number theory Joe Buhler and Stan Wagon
3. Elliptic curves Bjorn Poonen
4. The arithmetic of number rings Peter Stevenhagen
5. Fast multiplication and applications Dan Bernstein
6. Primality testing Rene Schoof
7. Smooth numbers: computational number theory and beyond Andrew Granville
8. Smooth numbers and the quadratic sieve Carl Pomerance
9. The number field sieve Peter Stevenhagen
10. Elementary thoughts on discrete logarithms Carl Pomerance
11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
12. Lattices Hendrik Lenstra
13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
14. Protecting communications against forgery Dan Bernstein
15. Computing Arakelov class groups Rene Schoof
16. Computational class field theory Henri Cohen and Peter Stevenhagen
17. Zeta functions over finite fields Daqing Wan
18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
19. How to get your hands on modular forms using modular symbols William Stein
20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.
1. Solving Pell's equation Hendrik Lenstra
2. Basic algorithms in number theory Joe Buhler and Stan Wagon
3. Elliptic curves Bjorn Poonen
4. The arithmetic of number rings Peter Stevenhagen
5. Fast multiplication and applications Dan Bernstein
6. Primality testing Rene Schoof
7. Smooth numbers: computational number theory and beyond Andrew Granville
8. Smooth numbers and the quadratic sieve Carl Pomerance
9. The number field sieve Peter Stevenhagen
10. Elementary thoughts on discrete logarithms Carl Pomerance
11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
12. Lattices Hendrik Lenstra
13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
14. Protecting communications against forgery Dan Bernstein
15. Computing Arakelov class groups Rene Schoof
16. Computational class field theory Henri Cohen and Peter Stevenhagen
17. Zeta functions over finite fields Daqing Wan
18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
19. How to get your hands on modular forms using modular symbols William Stein
20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.
2. Basic algorithms in number theory Joe Buhler and Stan Wagon
3. Elliptic curves Bjorn Poonen
4. The arithmetic of number rings Peter Stevenhagen
5. Fast multiplication and applications Dan Bernstein
6. Primality testing Rene Schoof
7. Smooth numbers: computational number theory and beyond Andrew Granville
8. Smooth numbers and the quadratic sieve Carl Pomerance
9. The number field sieve Peter Stevenhagen
10. Elementary thoughts on discrete logarithms Carl Pomerance
11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
12. Lattices Hendrik Lenstra
13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
14. Protecting communications against forgery Dan Bernstein
15. Computing Arakelov class groups Rene Schoof
16. Computational class field theory Henri Cohen and Peter Stevenhagen
17. Zeta functions over finite fields Daqing Wan
18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
19. How to get your hands on modular forms using modular symbols William Stein
20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.