Prime numbers and computer methods for factorization
Resource Information
The work Prime numbers and computer methods for factorization represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Prime numbers and computer methods for factorization
Resource Information
The work Prime numbers and computer methods for factorization represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 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
 Image bit depth
 0
 LC call number
 QA246
 LC item number
 .R54 2012
 Literary form
 non fiction
 Nature of contents
 dictionaries
 Series statement
 Modern Birkhäuser Classics
Context
Context of Prime numbers and computer methods for factorizationEmbed (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/resource/i3zCLYbl8nY/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/i3zCLYbl8nY/">Prime numbers and computer methods for factorization</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 Work Prime numbers and computer methods for factorization
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/resource/i3zCLYbl8nY/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/i3zCLYbl8nY/">Prime numbers and computer methods for factorization</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>