Prime numbers and computer methods for factorization / Hans Riesel.
By: Riesel, Hans
.
Material type: 
BookSeries: Progress in mathematics (Boston, Mass.): vol. 57.Publisher: Boston : Birkhauser, 1985Description: xvi, 463 p. : ill. ; 23 cm.ISBN: 0817632913.Subject(s): Numbers, Prime -- Data processing | Factorization (Mathematics) -- Data processingDDC classification: 512.7 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 512.7 (Browse shelf(Opens below)) | 1 | Available | 00025921 |
Enhanced descriptions from Syndetics:
In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics. The independent structure of each chapter of the book makes it highly readable for a wide variety of mathematicians, students of applied number theory, and others interested in both study and research in number theory and cryptography.
Includes bibliographical references and index.
The number of primes below a given limit -- The primes viewed at large -- Subtleties in the distribution of primes -- The recognition of primes -- Factorization -- Prime numbers and cryptography.