Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)
Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)
Resource Information
The item Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 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 of cryptography, and nonscientific 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 publickey) 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 numbertheoretic 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
 Language
 eng
 Edition
 2nd ed.
 Extent
 1 online resource (xviii, 464 p.)
 Note

 "Reprint of the 1994 edition."
 "Originally published as Volume 126 in the series Progress in mathematics"T.p. verso
 Contents

 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. MultiplePrecision Arithmetic
 Appendix 10. Fast Multiplication of Large Integers
 Appendix 11. The Stieltjes Integral
 Tables
 List of Textbooks
 Index
 Isbn
 9780817682989
 Label
 Prime numbers and computer methods for factorization
 Title
 Prime numbers and computer methods for factorization
 Statement of responsibility
 Hans Riesel
 Subject

 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 Mathematics
 Mathematics
 Mathematics
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 MATHEMATICS / Number Theory
 Factorization (Mathematics)  Data processing
 Electronic resources
 Factorization (Mathematics)  Data processing
 Numbers, Prime  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Electronic Data Processing
 Numbers, Prime  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Electronic Data Processing
 Language
 eng
 Summary
 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 of cryptography, and nonscientific 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 publickey) 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 numbertheoretic 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
 Cataloging source
 GW5XE
 http://library.link/vocab/creatorDate
 1929
 http://library.link/vocab/creatorName
 Riesel, Hans
 Image bit depth
 0
 LC call number
 QA246
 LC item number
 .R54 2012
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 SpringerLink
 Series statement
 Modern Birkhäuser Classics
 http://library.link/vocab/subjectName

 Electronic Data Processing
 Mathematics
 Numbers, Prime
 Factorization (Mathematics)
 MATHEMATICS / Number Theory
 Factorization (Mathematics)
 Numbers, Prime
 Label
 Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)
 Note

 "Reprint of the 1994 edition."
 "Originally published as Volume 126 in the series Progress in mathematics"T.p. verso
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Color
 not applicable
 Contents
 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. MultiplePrecision Arithmetic  Appendix 10. Fast Multiplication of Large Integers  Appendix 11. The Stieltjes Integral  Tables  List of Textbooks  Index
 Dimensions
 unknown
 Edition
 2nd ed.
 Extent
 1 online resource (xviii, 464 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9780817682989
 Level of compression
 uncompressed
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (OCoLC)765949013
 (OCoLC)ocn765949013
 Label
 Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)
 Note

 "Reprint of the 1994 edition."
 "Originally published as Volume 126 in the series Progress in mathematics"T.p. verso
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Color
 not applicable
 Contents
 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. MultiplePrecision Arithmetic  Appendix 10. Fast Multiplication of Large Integers  Appendix 11. The Stieltjes Integral  Tables  List of Textbooks  Index
 Dimensions
 unknown
 Edition
 2nd ed.
 Extent
 1 online resource (xviii, 464 p.)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Isbn
 9780817682989
 Level of compression
 uncompressed
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (OCoLC)765949013
 (OCoLC)ocn765949013
Subject
 Electronic Data Processing
 Electronic Data Processing
 Electronic resources
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 Factorization (Mathematics)  Data processing
 MATHEMATICS / Number Theory
 Mathematics
 Mathematics
 Mathematics
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
 Numbers, Prime  Data processing
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Primenumbersandcomputermethodsfor/IKYjC6tPfa4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Primenumbersandcomputermethodsfor/IKYjC6tPfa4/">Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Primenumbersandcomputermethodsfor/IKYjC6tPfa4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Primenumbersandcomputermethodsfor/IKYjC6tPfa4/">Prime numbers and computer methods for factorization, Hans Riesel, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>