000 04612nam a22003735i 4500
001 281895
003 MX-SnUAN
005 20160429154125.0
007 cr nn 008mamaa
008 150903s2012 xxu| o |||| 0|eng d
020 _a9780817682989
_99780817682989
024 7 _a10.1007/9780817682989
_2doi
035 _avtls000333731
039 9 _a201509030218
_bVLOAD
_c201404130523
_dVLOAD
_c201404092312
_dVLOAD
_y201402041118
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA241-247.5
100 1 _aRiesel, Hans.
_eautor
_9308035
245 1 0 _aPrime Numbers and Computer Methods for Factorization /
_cby Hans Riesel.
264 1 _aBoston, MA :
_bBirkhäuser Boston :
_bImprint: Birkhäuser,
_c2012.
300 _axviii, 464 páginas 20 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aModern Birkhäuser Classics
500 _aSpringer eBooks
505 0 _aPreface -- 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.
520 _aPublished 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 of cryptography, and non-scientific readers with a mathematical inclination, treating four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes, and the factorization of large numbers. The second edition of the work, released in the mid 1990s, expanded significantly upon the original book, including important advances in computational prime number theory and factorization, as well as revised and updated tables. With explicit algorithms and computer programs, the author illustrated applications while attempting to discuss many classically important results along with more modern discoveries. Although it has been over a decade since the publication of this second edition, the theory it contained remains still highly relevant, and the particular cryptosystem it addressed (RSA public-key) is ubiquitous. Therefore, in addition to providing a historical perspective on many of the issues in modern prime number theory and data encryption, this soft cover version—which reproduces the second edition exactly as it originally appeared—offers affordable access to a great deal of valuable information. Highly readable for a wide variety of mathematicians, students of applied number theory, and others, this modern classic will be of interest to anyone involved in the study of number theory and cryptography. Reviews: Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition... All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science.  —Zentralblatt MATH The book...is an enthusiastic introduction to some of the ideas concerned with primes and factorization. It should be of interest to anyone who would like to learn about the use of computers in number theory. —Mathematical Reviews
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780817682972
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-8176-8298-9
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c281895
_d281895