Contact
Comment faire ses achats
Livraison
Guide d'achat
Primality Testing and Integer Factorization in Public-Key Cryptography
Anglais
373 b
Jusqu'à 30 jours pour les retours
Les clients ont également acheté
/
Livre de poche
5.65
€
/
Livre de poche
10.60
€
/
Livre de poche
21.40
€
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.
À propos du livre
Anglais
Catégories
Offrez ce livre dès aujourd'hui
C’est simple
1 Ajouter au panier et choisir l'option Livrer comme cadeau à la caisse. 2 Nous vous enverrons un bon d'achat 3 Le livre arrivera à l'adresse du destinataireCeci pourrait également vous intéresser
/
Livre de poche
67.36
€
/
Livre de poche
55.24
€
/
Livre de poche
30.70
€
/
Livre de poche
21.91
€
Bonjour ! Je suis Libroamiko, votre conseiller littéraire.
Comment puis-je vous aider ?