Mohlo by sa vám tiež páčiť

Viac informácií o knihe Primality Testing and Integer Factorization in Public-Key Cryptography

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 373 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: Primality Testing and Integer Factorization in Public-Key Cryptography
• Autor: Song Y. Yan
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 371
• EAN: 9780387772677
• ISBN: 0387772677
• ID: 01382985
• Nakladateľ: Springer-Verlag New York Inc.
• Hmotnosť: 752 g
• Rozmery: 235 × 155 × 26 mm
• Dátum vydania: 02. December 2008

Obľúbené z iného súdka

---

---

---