Primality Testing and Integer Factorization in Public-Key Cryptography
(Sprache: Englisch)
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...
Jetzt vorbestellen
versandkostenfrei
Buch (Gebunden)
160.49 €
80 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Primality Testing and Integer Factorization in Public-Key Cryptography “
Klappentext zu „Primality Testing and Integer Factorization in Public-Key Cryptography “
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.
Inhaltsverzeichnis zu „Primality Testing and Integer Factorization in Public-Key Cryptography “
Number-Theoretic Preliminaries.- Primality Testing and Prime Generation.- Integer Factorization and Discrete Logarithms.- Number-Theoretic Cryptography.
Bibliographische Angaben
- Autor: Song Y. Yan
- 2008, 2nd ed., XVIII, 371 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer, Berlin
- ISBN-10: 0387772677
- ISBN-13: 9780387772677
- Erscheinungsdatum: 02.12.2008
Sprache:
Englisch
Rezension zu „Primality Testing and Integer Factorization in Public-Key Cryptography “
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)
Pressezitat
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)
Kommentar zu "Primality Testing and Integer Factorization in Public-Key Cryptography"
0 Gebrauchte Artikel zu „Primality Testing and Integer Factorization in Public-Key Cryptography“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Primality Testing and Integer Factorization in Public-Key Cryptography".
Kommentar verfassen