Primality testing and integer factorization in public-key cryptography

書誌事項

Primality testing and integer factorization in public-key cryptography

by Song Y. Yan

(Advances in information security, 11)

Kluwer Academic Publishers, c2004

タイトル別名

ADIS11

大学図書館所蔵 件 / 13

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ