Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Yan, Song Y.
ISBN 10: 1441945865 ISBN 13: 9781441945860
Edité par Springer, 2010
Neuf(s)
Couverture souple
Vendeur
Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 25 mars 2015
Cet article spécifique n'est plus disponible.
A propos de cet article
Description :
In. N° de réf. du vendeur ria9781441945860_new
Synopsis :
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Détails bibliographiques
Titre : Primality Testing and Integer Factorization ...
Éditeur : Springer
Date d'édition : 2010
Reliure : Couverture souple
Etat : New
Meilleurs résultats de recherche sur AbeBooks
Image fournie par le vendeur
Primality Testing and Integer Factorization in Public-Key Cryptography
impression à la demandeVendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. New section on quantum factoring and post-quantum cryptographyExercises and research problems grouped into new section after each chapter thus more suitable as advanced graduate textIntended for advanced level students in computer scie. N° de réf. du vendeur 4174926
Acheter neuf
EUR 136,16
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Primality Testing and Integer Factorization in Public-Key Cryptography
impression à la demandeVendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Primality Testing and Integer Factorization in Public-Key Cryptography | Song Y. Yan | Taschenbuch | xviii | Englisch | 2010 | Springer US | EAN 9781441945860 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 107137591
Acheter neuf
EUR 141,30
EUR 70 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 2nd ed. softcover of orig. ed. 2009 edition. 392 pages. 9.00x6.00x0.89 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __1441945865
Acheter neuf
EUR 153,28
EUR 14,31 shipping
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2411530296035
Acheter neuf
EUR 156,28
EUR 3,39 shipping
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography (Paperback)
Edité par
Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10 : 1441945865
ISBN 13 : 9781441945860
Neuf
Paperback
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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. 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). Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781441945860
Acheter neuf
EUR 156,97
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Primality Testing and Integer Factorization in Public-Key Cryptography
Edité par
Springer US, Springer New York Nov 2010, 2010
ISBN 10 : 1441945865
ISBN 13 : 9781441945860
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 392 pp. Englisch. N° de réf. du vendeur 9781441945860
Acheter neuf
EUR 160,49
EUR 60 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Primality Testing and Integer Factorization in Public-Key Cryptography
Edité par
Springer US, Springer New York, 2010
ISBN 10 : 1441945865
ISBN 13 : 9781441945860
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9781441945860
Acheter neuf
EUR 166,62
EUR 62,97 shipping
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781441945860
Acheter neuf
EUR 176,85
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 392 2nd Edition. N° de réf. du vendeur 263107756
Acheter neuf
EUR 208,82
EUR 3,39 shipping
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 4 disponible(s)
Image d'archives
Primality Testing and Integer Factorization in Public-Key Cryptography (Paperback)
Edité par
Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10 : 1441945865
ISBN 13 : 9781441945860
Neuf
Paperback
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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. 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). Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9781441945860
Acheter neuf
EUR 216,15
EUR 31,45 shipping
Expédition depuis Australie vers Etats-Unis
Expédition depuis Australie vers Etats-Unis
Quantité disponible : 1 disponible(s)