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

Seller: Biblios, frankfurt am main, hessen, GermanyBiblios
4-star seller
AbeBooks seller since September 10, 2024
Hardcover
Condition: Used
US$ 135.59
US$ 11.56 shipping
Ships from Germany to U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
pp. xvi + 236.
Seller Inventory # 183129860
- Title
- Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security)
- Author
- Yan Song Y.
- Publisher
- Springer
- Publication year
- 2003
- Condition
- Used
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1402076495
- ISBN 13
- 9781402076497
- Series
- Book 59 of 109: Advances in Information Security
Primality testing and integer factorization, as identified by Gauss in his "Disquisitiones Arithmeticae", Article 329, in 1801, are the two most fundamental problems (as well as the two most important research fields) in computational number theory. With the advent of modern computers, unexpected applications have also been found in primality testing and integer factorization.
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.
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
Song Yan is currently with the School of Mathematical and Information Sciences at Coventry University England.
"About the title" may belong to another edition of this title.
Biblios
frankfurt am main, hessen, Germany
4-star seller
AbeBooks seller since September 10, 2024
Shipping rates from Germany to U.S.A.
| Item | 25 to 45 business days | 8 to 14 business days |
|---|---|---|
| First item | US$ 11.56 | US$ 21.72 |
Payment methods
Store description
We carry a wide selection of books from South Asia, United States, UK.
Specialty
new books imported from india, uk, usaSeller's business information
Readingos GmbH
Kaiserstraße 47
Frankfurt am Main, Germany 60329
Shipping terms
To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.