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
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 10-13 dnů
3 426
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (...

Informace o knize

Autor
Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2008
Stránek
371
EAN
9780387772677
ISBN
0387772677
Enbook ID
01382985
Hmotnost
752
Rozměry
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 zajímat

1 147
589

One Of Us Is Lying

Karen M. McManus
200
241

Educational Goods

Harry Brighouse
767
1 464
329
230
263
230

Art and Prudence

Ralph Mcinerny
501
1 452

Zákaznicí kteří koupili tuto knihu koupili také

Z New Yorku ...

Frieda Rossová
113
484
526

One Last Stop

Casey McQuiston
39
742
129

Modeste Mignon

Balzac Honore De
451
394