Prime numbers and computer methods for factorization

Published in the mid 1980s, the highly successful first edition of this title investigated the mathematical underpinnings of computer encryption, a discipline drawing heavily on the factorization of large numbers into primes. The book served a broad audience of researchers, students, practitioners o...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: Riesel, Hans, 1929-2014
Médium: Livre numérique
Jazyk:Anglais
Vydáno: Boston, MA : Birkhäuser Boston [20..].
Cham : Springer Nature
Vydání:2nd ed. 2012.
Edice:Modern Birkhäuser Classics
Témata:
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Prime numbers and computer methods for factorization, Hans Riesel, Second edition (reprint of the 1994), 2012, Boston, Birkhäuser, Springer, 1 vol. (XVIII-464 p.), Modern Birkhäuser Classics, 978-0-8176-8297-2
• Prime Numbers and Computer Methods for Factorization, Texte imprimé, 9780817682996
Obsah:
  • Preface The Number of Primes Below a Given Limit The Primes Viewed at Large Subtleties in the Distribution of Primes The Recognition of Primes Classical Methods of Factorization Modern Factorization Methods Prime Numbers and Cryptography Appendix 1. Basic Concepts in Higher Algebra Appendix 2. Basic concepts in Higher Arithmetic Appendix 3. Quadratic Residues Appendix 4. The Arithmetic of Quadratic Fields Appendix 5. Higher Algebraic Number Fields Appendix 6. Algebraic Factors Appendix 7. Elliptic Curves Appendix 8. Continued Fractions Appendix 9. Multiple-Precision Arithmetic Appendix 10. Fast Multiplication of Large Integers Appendix 11. The Stieltjes Integral Tables List of Textbooks Index