Książka 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
Język: Angielski
Oprawa: Twarda
Dostępność: Dostępna u dostawcy
Wysyłamy za 10-13 dni
634.56
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (...

Informacje o książce

Autor
Język
Angielski
Oprawa
Książka - Twarda
Data wydania
2008
strony
371
EAN
9780387772677
ISBN
0387772677
Enbook ID
01382985
Waga
752
Wymiary
155 x 235 x 26

Pełny opis

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.

Możesz być zainteresowany

212.42
109.23

One Of Us Is Lying

Karen M. McManus
39.91
48.77

Educational Goods

Harry Brighouse
140.38
271.42
60.84
42.44
48.38
42.44

Art and Prudence

Ralph Mcinerny
91.80
254.38
89.36

Klienci, którzy kupili tę książkę, kupili również

Z New Yorku ...

Frieda Rossová
18.98
84.79
92.09

One Last Stop

Casey McQuiston
6.81
129.96
22.58

Modeste Mignon

Balzac Honore De
83.23
73.40