Stock photo: cover may vary
Primality Testing And Integer Factorization In Public-Key Cryptography 2Ed (Hb 2008) Hardback - 2008
by Song Y. Yan
- New
A$128.48
A$21.94
Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Standard delivery: 7 to 14 days
Details
- Title Primality Testing And Integer Factorization In Public-Key Cryptography 2Ed (Hb 2008)
- Author Song Y. Yan
- Binding Hardback
- Edition Us Edition
- Condition New
- Pages 371
- Volumes 1
- Language ENG
- Publisher Springer, New York, NY
- Publication date 2008-12-02
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- Bookseller's Inventory # BIBNNA-69861
- ISBN 9780387772677 / 0387772677
- Weight 1.5 lbs (0.68 kg)
- Dimensions 9.3 x 6.1 x 0.9 in (23.62 x 15.49 x 2.29 cm)
-
Themes
- Aspects (Academic): Applied/Practical
- Category Computers - Computer Security
- Library of Congress subjects Computer security, Cryptography
- Library of Congress Catalogue Number 2008935407
- Dewey Decimal Code 005.82
- Quantity available 2
About Students Textbooks India
Specialising in: International Edition., Textbooks
Biblio member since 2009
Selling textbooks, International editions and reference books online from last 5 Years.
30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged. Return address: Students_Textbooks 12 phankha road Jankpuri New Delhi 110036 India
Reader reviews for Primality Testing And Integer Factorization In Public-Key Cryptography 2Ed (Hb 2008)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography.
Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography.
To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars.
Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics.
