Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Yan, Song Y.
ISBN 10: 1441945865 ISBN 13: 9781441945860
Verlag: Springer, 2010
Neu
Softcover
Verkäufer
Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 25. März 2015
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
In. Bestandsnummer des Verkäufers ria9781441945860_new
Inhaltsangabe:
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.
Über die Autorin bzw. den Autor: Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Primality Testing and Integer Factorization ...
Verlag: Springer
Erscheinungsdatum: 2010
Einband: Softcover
Zustand: New
Beste Suchergebnisse bei AbeBooks
Foto des Verkäufers
Primality Testing and Integer Factorization in Public-Key Cryptography
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 4174926
Neu kaufen
EUR 136,16
EUR 48,99 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Primality Testing and Integer Factorization in Public-Key Cryptography
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 107137591
Neu kaufen
EUR 141,30
EUR 70,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography
Print-on-DemandAnbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers __1441945865
Neu kaufen
EUR 152,92
EUR 14,28 shipping
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar2411530296035
Neu kaufen
EUR 156,98
EUR 3,41 shipping
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography (Paperback)
Verlag:
Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10: 1441945865
ISBN 13: 9781441945860
Neu
Paperback
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781441945860
Foto des Verkäufers
Primality Testing and Integer Factorization in Public-Key Cryptography
Verlag:
Springer US, Springer New York Nov 2010, 2010
ISBN 10: 1441945865
ISBN 13: 9781441945860
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9781441945860
Neu kaufen
EUR 160,49
EUR 60,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Primality Testing and Integer Factorization in Public-Key Cryptography
Verlag:
Springer US, Springer New York, 2010
ISBN 10: 1441945865
ISBN 13: 9781441945860
Neu
Taschenbuch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9781441945860
Neu kaufen
EUR 166,62
EUR 62,97 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography (Advances in Information Security, 11)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9781441945860
Neu kaufen
EUR 177,64
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 392 2nd Edition. Bestandsnummer des Verkäufers 263107756
Neu kaufen
EUR 209,76
EUR 3,41 shipping
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Primality Testing and Integer Factorization in Public-Key Cryptography (Paperback)
Verlag:
Springer-Verlag New York Inc., New York, NY, 2010
ISBN 10: 1441945865
ISBN 13: 9781441945860
Neu
Paperback
Anbieter: AussieBookSeller, Truganina, VIC, Australien
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781441945860
Neu kaufen
EUR 215,65
EUR 31,59 shipping
Versand von Australien nach USA
Versand von Australien nach USA
Anzahl: 1 verfügbar