Text

Primality testing and integer factorization in public-key cryptography

---

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

---

Availability

Detail Information

Series Title

-

Call Number

005.82 YAN p

Publisher

Boson : kluwer academic publisers., 2004

Collation

xvi, 236 hal : ilus. ; 25 cm.

Language

ISBN/ISSN

9781402076497

Classification

005.82

Content Type

-

Media Type

-

Carrier Type

-

Edition

first edition

Subject(s)

Cryptography
Computer security

Specific Detail Info

-

Statement of Responsibility

Song Y. Yan.

Other Information

Link

-

Daftar Isi

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment