Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security)
Language: English
Published by Springer, 2003
- Hardcover
- Used

Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
AbeBooks seller since March 9, 2023
Condition: Used - Good
US$ 80.65
Quantity: 1 available
Add to basketItem description from seller
A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.
Seller Inventory # OTV.1402076495.G
- Title
- Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security)
- Author
- Yan, Song Y.
- Publisher
- Springer
- Publication year
- 2003
- Condition
- good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1402076495
- ISBN 13
- 9781402076497
- Series
- Book 59 of 109: Advances in Information Security
Primality Testing and Integer Factorization in Public-Key Cryptography introduces various algorithms for primality testing and integer factorization, with their applications in public-key cryptography and information security. More specifically, this book explores basic concepts and results in number theory in Chapter 1. Chapter 2 discusses various algorithms for primality testing and prime number generation, with an emphasis on the Miller-Rabin probabilistic test, the Goldwasser-Kilian and Atkin-Morain elliptic curve tests, and the Agrawal-Kayal-Saxena deterministic test for primality. Chapter 3 introduces various algorithms, particularly the Elliptic Curve Method (ECM), the Quadratic Sieve (QS) and the Number Field Sieve (NFS) for integer factorization. This chapter also discusses some other computational problems that are related to factoring, such as the square root problem, the discrete logarithm problem and the quadratic residuosity problem. The final chapter presents the applications of the problems/techniques of primality testing, integer factorization, square roots, discrete logarithms and quadratic residuosity in public-key cryptography.
Primality Testing and Integer Factorization in Public-Key Cryptography is designed for a professional audience composed of researchers and practitioners in industry. This book is also suitable as a secondary text for graduate-level students in computer science, mathematics and engineering.
"Synopsis" may belong to another edition of this title.
About the Author
"About the title" may belong to another edition of this title.
-OnTimeBooks-
Phoenix, AZ, U.S.A.
AbeBooks seller since March 9, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Specialty
Used books of all typesSeller's business information
BookDrop LLC
601 S 54th Ave, STE 101
Phoenix, AZ U.S.A. 85043