Kniha Primality Testing and Integer Factorization in Public-Key Cryptography Song Y. Yan

Primality Testing and Integer Factorization in Public-Key Cryptography

Autor: Song Y. Yan
Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: Skladom u dodávateľa
Odosielame za 10-13 dní
149.91
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (...

Informácie o knihe

Autor
Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
2008
Stránok
371
EAN
9780387772677
ISBN
0387772677
Enbook ID
01382985
Hmotnosť
752
Rozmery
155 x 235 x 26

Kompletný popis

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.

Mohlo by vás zaujímať

50.19
25.83

One Of Us Is Lying

Karen M. McManus
8.24
10.70

Educational Goods

Harry Brighouse
31.72
63.65
13.65
9.52
10.90
9.52

Art and Prudence

Ralph Mcinerny
20.72
60.12
21.11

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Z New Yorku ...

Frieda Rossová
4.67
20.03
21.70

One Last Stop

Casey McQuiston
1.56
30.74
5.39

Modeste Mignon

Balzac Honore De
18.66
17.38