Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Primality Testing and Integer Factorization in Public-Key Cryptography
Engleski
373 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
21.46
€
/
Meki uvez
5.66
€
/
Meki uvez
10.62
€
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.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
66.13
€
/
Meki uvez
30.78
€
/
Meki uvez
55.39
€
/
Meki uvez
25.11
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?