Primality Testing and Integer Factorization in Public-Key Cryptography
Yan, Song Y.
Produktnummer:
187ab41c2a2f6149469b0fb5c3421cb977
| Autor: | Yan, Song Y. |
|---|---|
| Themengebiete: | DES Discrete Logarithms Elliptic Curve Cryptography Factorization Integer Number theory Primality Prime Prime Generation Prime number |
| Veröffentlichungsdatum: | 02.12.2008 |
| EAN: | 9780387772677 |
| Auflage: | 2 |
| Sprache: | Englisch |
| Seitenzahl: | 371 |
| Produktart: | Gebunden |
| Verlag: | Springer US |
Produktinformationen "Primality Testing and Integer Factorization in Public-Key Cryptography"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen