Bild 1 von 4



Galerie
Bild 1 von 4




Primality Testing And Integer Factorization In Public-Key Cryptography, Hardc...
US $79,99
Ca.EUR 68,74
oder Preisvorschlag
Artikelzustand:
3 verfügbar
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
US $5,22 (ca. EUR 4,49) USPS Media MailTM.
Standort: Searcy, Arkansas, USA
Lieferung:
Lieferung zwischen Sa, 13. Dez und Fr, 19. Dez nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
- Gratis Rückversand im Inland
- Punkte für jeden Kauf und Verkauf
- Exklusive Plus-Deals
Info zum Artikel
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:127053266466
Artikelmerkmale
- Artikelzustand
- Book Title
- Primality Testing And Integer Factorization In Public-Key Cryptog
- Personalized
- No
- ISBN
- 9780387772677
Über dieses Produkt
Product Identifiers
Publisher
Springer
ISBN-10
0387772677
ISBN-13
9780387772677
eBay Product ID (ePID)
65569631
Product Key Features
Number of Pages
Xviii, 371 Pages
Language
English
Publication Name
Primality Testing and Integer Factorization in Public-Key Cryptography
Subject
Communication Studies, Security / Cryptography, Computer Science, Security / General, Number Theory
Publication Year
2008
Type
Textbook
Subject Area
Mathematics, Computers, Language Arts & Disciplines
Series
Advances in Information Security Ser.
Format
Hardcover
Dimensions
Item Weight
26.5 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
LCCN
2008-935407
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)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), 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)
Dewey Edition
23
Series Volume Number
11
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
005.8
Table Of Content
Number-Theoretic Preliminaries.- Primality Testing and Prime Generation.- Integer Factorization and Discrete Logarithms.- Number-Theoretic Cryptography.
Synopsis
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., 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. First edition was very positively reviewed by Prof Samuel Wagstaff at Purdue University in AMS Mathematical Reviews (See MR2028480 2004j:11148), and by Professor J.T. Ayuso of University of Simon Bolivar in the European Mathematical Society's review journal Zentralblatt f r Mathematik (see Zbl 1048.11103)., 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. First edition was very positively reviewed by Prof Samuel Wagstaff at Purdue University in AMS Mathematical Reviews (See MR2028480 2004j:11148), and by Professor J.T. Ayuso of University of Simon Bolivar in the European Mathematical Society's review journal Zentralblatt für Mathematik (see Zbl 1048.11103).
LC Classification Number
QA268
Artikelbeschreibung des Verkäufers
Rechtliche Informationen des Verkäufers
Info zu diesem Verkäufer
The Redbird Emporium
100% positive Bewertungen•1.731 Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Beliebte Kategorien in diesem Shop
Verkäuferbewertungen (733)
- f***x (2)- Bewertung vom Käufer.Letzter MonatBestätigter KaufSecurely wrapped, good condition as described, delivered in a timely manner, and price was half of what I had ordered and seller cancelled through Amazon.
- c***p (1092)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufAn excellent copy of an impossible to get title that I never expected to see again. Better than described. Like new. The seller was over-cautious in their description of any flaws which were next to none. Best purchase I've made all year. Fast and secure packaging and shipping. Very satisfied. Thanks!The Bible of Corruption Ahriman's Word by Dastur Adam Daniels (Nr. 127288255552)
- n***e (1024)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufFast shipping, carefully packaged, exactly as described, and very fair price. Highly recommended seller. A+++++STORYVILLE NEW ORLEAN AL ROSE UNIV ALABAMA PRESS 7TH 1989 ILL RED LIGHT DISTRICT (Nr. 126973405939)

