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...
| Autor principal: | |
|---|---|
| Autor Corporativo: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Boston, MA :
Birkhäuser Boston
2012.
|
| Colección: | Modern Birkhäuser Classics.
Springer eBooks. |
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b32906572*spi |
Tabla de Contenidos:
- 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.
