Vendeur : Basi6 International, Irving, TX, Etats-Unis
EUR 55,52
Quantité disponible : 8 disponible(s)
Ajouter au panierEtat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 55,52
Quantité disponible : 5 disponible(s)
Ajouter au panierEtat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Vendeur : SMASS Sellers, IRVING, TX, Etats-Unis
EUR 57,78
Quantité disponible : 5 disponible(s)
Ajouter au panierEtat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
EUR 60,79
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
EUR 59,78
Quantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
EUR 63,27
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Vendeur : SMASS Sellers, IRVING, TX, Etats-Unis
EUR 63,27
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 66,33
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 392 2nd Edition.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 64,42
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 392 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 64,51
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. 392.
Edité par Springer
ISBN 10 : 8120090004 ISBN 13 : 9788120090002
Vendeur : Books in my Basket, New Delhi, Inde
EUR 41,97
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. ISBN: 9780387772677.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 109,94
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. xvi + 236 1st Edition.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 111,92
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. xvi + 236 Illus.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 114,09
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. pp. xvi + 236.
Vendeur : Buchpark, Trebbin, Allemagne
EUR 43,60
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : Sehr gut. Zustand: Sehr gut | Seiten: 392 | Sprache: Englisch | Produktart: Bücher | 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.
Langue: anglais
Edité par Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10 : 1441945865 ISBN 13 : 9781441945860
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 156,76
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. 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.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 161,76
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 164,17
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 161,74
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 179,09
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 179,25
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par Springer-Verlag New York Inc., 2010
ISBN 10 : 1441945865 ISBN 13 : 9781441945860
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 175,84
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback / softback. Etat : New. New copy - Usually dispatched within 4 working days.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 180,07
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 203,68
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. pp. 392 2nd Edition.
Langue: anglais
Edité par Springer, 2009
Vendeur : Books in my Basket, New Delhi, Inde
EUR 195,18
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : New. ISBN:9780387772677.
Vendeur : preigu, Osnabrück, Allemagne
EUR 140
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Primality Testing and Integer Factorization in Public-Key Cryptography | Song Y. Yan | Taschenbuch | Advances in Information Security | xviii | Englisch | 2010 | Springer | EAN 9781441945860 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Langue: anglais
Edité par Springer US, Springer New York Dez 2008, 2008
ISBN 10 : 0387772677 ISBN 13 : 9780387772677
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 160,49
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. 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.
Langue: anglais
Edité par Springer US, Springer New York Nov 2010, 2010
ISBN 10 : 1441945865 ISBN 13 : 9781441945860
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 160,49
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. 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.
Langue: anglais
Edité par Springer US, Springer New York, 2010
ISBN 10 : 1441945865 ISBN 13 : 9781441945860
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 166,62
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. 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.
Langue: anglais
Edité par Springer US, Copernicus, 2008
ISBN 10 : 0387772677 ISBN 13 : 9780387772677
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 166,62
Quantité disponible : 1 disponible(s)
Ajouter au panierBuch. 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.