Prime Numbers and Computer Methods for Factorization (Modern Birkhäuser Classics) - Image 1

£61.23

Birkhauser Prime Numbers and Computer Methods for Factorization (Modern Birkhäuser Classics)

Name: Prime Numbers and Computer Methods for Factorization (Modern Birkhauser Classics)
Brand: Birkhauser
Price: 61.23 GBP
Availability: InStock

Security

About as cheap as it gets. The only time it was cheaper was 1 year ago.

£61 today · all-time low £59 (Feb 2025) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 616 days • 616 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 616 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £61 (467 days, 75.8%)

Price range: £59 - £70

Price levels: 3 different prices over 616 days

Description

From the original hard cover edition: 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. Hans Riesel’s highly successful first edition of this book has now been enlarged and updated with the goal of satisfying the needs of researchers, students, practitioners of cryptography, and non-scientific readers with a mathematical inclination. It includes important advances in computational prime number theory and in factorization as well as re-computed and enlarged tables, accompanied by new tables reflecting current research by both the author and his coworkers and by independent researchers. The book treats 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 author provides explicit algorithms and computer programs, and has attempted to discuss as many of the classically important results as possible, as well as the most recent discoveries. The programs include are written in PASCAL to allow readers to translate the programs into the language of their own computers. 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.

Product Specifications

Brand: Birkhauser
Format: paperback
ASIN: 081768297X
Category: Books > Subjects > Computing & Internet > Networking & Security > Security
Domain: Amazon UK
Release Date: 22 November 2011
Listed Since: 04 August 2011

Barcode

No barcode data available

Birkhauser Prime Numbers and Computer Methods for Factorization (Modern Birkhäuser Classics)

About as cheap as it gets. The only time it was cheaper was 1 year ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Prime Numbers and Computer Methods for Factorization: 126 (Progress in Mathematics, 126)

Primes and Programming: An Introduction to Number Theory with Computing

The Development of Prime Number Theory: From Euclid to Hardy and Littlewood (Springer Monographs in Mathematics)

Prime Numbers: A Computational Perspective

Prime-Detecting Sieves (LMS-33): 1 (London Mathematical Society Monographs)

Prime-Detecting Sieves: 1 (London Mathematical Society Monographs)

The Distribution of Prime Numbers (Graduate Studies in Mathematics)

Bounded Gaps Between Primes: The Epic Breakthroughs of the Early Twenty-First Century

Number Theory: An Introduction via the Density of Primes

Primes of the Form x2+ny2: Fermat, Class Field Theory, and Complex Multiplication, 2nd Edition (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

Elementary Number Theory with Programming

Multiplicative Number Theory I. Classical Theory: 97 (Cambridge Studies in Advanced Mathematics, Series Number 97)

Advanced Number Theory with Applications (Discrete Mathematics and Its Applications)

Computational Number Theory (Discrete Mathematics and Its Applications)

A Comprehensive Course in Number Theory

A Course in Number Theory (Oxford Science Publications)

Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography

Elementary Number Theory: Primes, Congruences, and Secrets: A Computational Approach (Undergraduate Texts in Mathematics)

Fundamental Number Theory with Applications (Discrete Mathematics and Its Applications)

Perfect And Amicable Numbers: 2 (Selected Chapters Of Number Theory: Special Numbers)

Chapman and Hall/CRC Cryptanalysis of Number Theoretic Ciphers

Number Theory with Computations (Springer Undergraduate Mathematics Series)

Elementary Number Theory (Textbooks in Mathematics)

Number Theory Revealed: A Masterclass (Miscellaneous Books)