第 1/4 張圖片




圖片庫
第 1/4 張圖片




有類似物品要出售?
Primality Testing And Integer Factorization In Public-Key Cryptography, Hardc...
US $79.99
大約HK$ 622.38
或講價
狀況:
庫存 3 件
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
運送:
US $5.22(大約 HK$ 40.62) USPS Media MailTM.
所在地:Searcy, Arkansas, 美國
送達日期:
估計於 12月13日 (星期六)至 12月19日 (星期五)之間送達 運送地點 94104
退貨:
30 日退貨. 由買家支付退貨運費,如果你使用 eBay 郵寄標籤,相關費用將從你的退款金額中扣除.
保障:
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
(不符合「eBay 買家保障方案」資格)
關於物品
物品細節
- 物品狀況
- 全新: 全新,未閱讀過和使用過的書籍,狀況完好,不存在缺頁或內頁受損。 查看所有物品狀況定義會在新視窗或分頁中開啟
- Book Title
- Primality Testing And Integer Factorization In Public-Key Cryptog
- Personalized
- No
- ISBN
- 9780387772677
關於產品
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
賣家提供的物品說明
賣家信用評價 (733)
- f***x (2)- 買家留下的信用評價。過去 1 個月購買已獲認證Securely 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)- 買家留下的信用評價。過去 6 個月購買已獲認證An 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(#127288255552)
- n***e (1024)- 買家留下的信用評價。過去 6 個月購買已獲認證Fast 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(#126973405939)

