Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security)

Yan, Song Y.

ISBN 10: 1402076495 / ISBN 13: 9781402076497

Edité par Springer, 2003

A propos de cet article

Very GoodDust Jacket may NOT BE INCLUDED.CDs may be missing. N° de réf. du vendeur ERICA83014020764953

Détails bibliographiques

Titre : Primality Testing and Integer Factorization ...

Éditeur : Springer

Date d'édition : 2003

Reliure : Hardcover

Etat : Very Good

Etat de la jaquette : Jaquette

Type de livre : book

A propos de ce titre

Synopsis :

"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.