Overview

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). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP. Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test. This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.

Full Product Details

Author:   Song Y. Yan
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2nd ed. 2009
Volume:   11
Dimensions:   Width: 15.50cm , Height: 2.20cm , Length: 23.50cm
Weight:   0.752kg
ISBN:  

9780387772677

ISBN 10:   0387772677
Pages:   371
Publication Date:   02 December 2008
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Number-Theoretic Preliminaries.- Primality Testing and Prime Generation.- Integer Factorization and Discrete Logarithms.- Number-Theoretic Cryptography.

Reviews

From the reviews of the second edition: The well-written and self-contained second edition 'is designed for a professional audience composed of researchers practitioners in industry.' In addition, 'this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,' as it contains about 300 problems. ! Overall ! 'this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.' (Hao Wang, ACM Computing Reviews, April, 2009)

From the reviews of the second edition: The well-written and self-contained second edition 'is designed for a professional audience composed of researchers practitioners in industry.' In addition, 'this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,' as it contains about 300 problems. ... Overall ... 'this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.' (Hao Wang, ACM Computing Reviews, April, 2009) This is the second edition of a book originally published in 2004. ... I used it as a reference in preparing lectures for an advanced cryptography course for undergraduates, and it proved to be a wonderful source for a general description of the algorithms. ... the book will be a valuable addition to any good reference library on cryptography and number theory ... . It contains descriptions of all the main algorithms, together with explanations of the key ideas behind them. (S. C. Coutinho, SIGACT News, April, 2012)

From the reviews of the second edition: ""The well-written and self-contained second edition ‘is designed for a professional audience composed of researchers practitioners in industry.’ In addition, ‘this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,’ as it contains about 300 problems. … Overall … ‘this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.’"" (Hao Wang, ACM Computing Reviews, April, 2009) “This is the second edition of a book originally published in 2004. … I used it as a reference in preparing lectures for an advanced cryptography course for undergraduates, and it proved to be a wonderful source for a general description of the algorithms. … the book will be a valuable addition to any good reference library on cryptography and number theory … . It contains descriptions of all the main algorithms, together with explanations of the key ideas behind them.” (S. C. Coutinho, SIGACT News, April, 2012)

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions