Primality Testing and Integer Factorization in Public-Key Cryptography

Song Y. Yan (Autor)

Buch | Softcover

371 Seiten

2010 | Softcover reprint of hardcover 2nd ed. 2009
Springer-Verlag New York Inc.
978-1-4419-4586-0 (ISBN)

Artikel merken

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.

This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.

Number-Theoretic Preliminaries.- Primality Testing and Prime Generation.- Integer Factorization and Discrete Logarithms.- Number-Theoretic Cryptography.

Erscheint lt. Verlag	29.11.2010
Reihe/Serie	Advances in Information Security ; 11
Zusatzinfo	40 Illustrations, black and white; XVIII, 371 p. 40 illus.
Verlagsort	New York, NY
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Netzwerke ► Sicherheit / Firewall
	Informatik ► Software Entwicklung ► Qualität / Testen
	Informatik ► Theorie / Studium ► Algorithmen
	Informatik ► Theorie / Studium ► Kryptologie
	Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie
ISBN-10	1-4419-4586-5 / 1441945865
ISBN-13	978-1-4419-4586-0 / 9781441945860
Zustand	Neuware