Skip to main content
Cart 0
Primality Testing and Integer Factorization in Public-Key Cryptography
Click to zoom

Share this book

Primality Testing and Integer Factorization in Public-Key Cryptography

Softcover reprint of hardcover 2nd ed. 2009

Book Details

Format Paperback / softback
ISBN-10 1441945865
ISBN-13 9781441945860
Edition Softcover reprint of hardcover 2nd ed. 2009
Publisher Springer-Verlag New York Inc.
Imprint Springer-Verlag New York Inc.
Country of Manufacture US
Country of Publication GB
Publication Date Nov 29th, 2010
Print length 371 Pages
KSh 23,400.00
Currently unavailable 0 in stock

Delivery Location

Delivery fee: Select location

Secure
Quality
Fast
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P).

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test.


Get Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer-Verlag New York Inc. and it has 371 pages.

Shopping Cart

Africa largest book store

Sub Total: