s'inscrire
Conseils d'fr.eurobuch.ch
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
Livre conseillé
Actualités
Publicité
Annonce payée
- 0 Résultats
prix le plus bas: € 166,99, prix le plus élevé: € 270,41, prix moyen: € 192,58
Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
(*)
Song Y. Yan:
Primality Testing and Integer Factorization in Public-Key Cryptography - nouveau livre

2004, ISBN: 9781441945860

ID: 978144194586

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.First edition was very positively reviewed by Prof Samuel Wagstaff at Purdue University in AMS Mathematical Reviews (See MR2028480 2004j:11148), and by Professor J.T. Ayuso of University of Simon Bolivar in the European Mathematical Society''s review journal Zentralblatt für Mathematik (see Zbl 1048.11103). Song Y. Yan, Books, Computers, Primality Testing and Integer Factorization in Public-Key Cryptography Books>Computers, Springer-Verlag/Sci-Tech/Trade

 Indigo.ca
new Free shipping on orders above $25. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
(*)
Song Y. Yan:
Primality Testing and Integer Factorization in Public-Key Cryptography - nouveau livre

2010, ISBN: 9781441945860

ID: 961481438

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. First edition was very positively reviewed by Prof Samuel Wagstaff at Purdue University in AMS Mathematical Reviews (See MR2028480 2004j:11148), and by Professor J.T. Ayuso of University of Simon Bolivar in the European Mathematical Societys review journal Zentralblatt für Mathematik (see Zbl 1048.11103). Primality Testing and Integer Factorization in Public-Key Cryptography Buch (fremdspr.) Taschenbuch 29.11.2010 Bücher>Fremdsprachige Bücher>Englische Bücher, Springer Us, .201

 Orellfuessli.ch
No. 27321067. Frais d'envoiZzgl. Versandkosten. (EUR 15.91)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
(*)
Song Y. Yan:
Primality Testing and Integer Factorization in Public-Key Cryptography - nouveau livre

2004, ISBN: 9781441945860

ID: 921614381

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. First edition was very positively reviewed by Prof Samuel Wagstaff at Purdue University in AMS Mathematical Reviews (See MR2028480 2004j:11148), and by Professor J.T. Ayuso of University of Simon Bolivar in the European Mathematical Societys review journal Zentralblatt für Mathematik (see Zbl 1048.11103). Primality Testing and Integer Factorization in Public-Key Cryptography Buch (fremdspr.) Bücher>Fremdsprachige Bücher>Englische Bücher, Springer Us

 Thalia.de
No. 27321067. Frais d'envoi, Versandfertig in 2 - 3 Tagen, DE. (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
(*)
Song Y. Yan:
Primality Testing and Integer Factorization in Public-Key Cryptography - Livres de poche

ISBN: 9781441945860

ID: 9781441945860

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. Books > Computer Science Soft cover, Springer Shop

 Springer.com
new in stock. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
(*)
Song Y. Yan:
Primality Testing and Integer Factorization in Public-Key Cryptography - livre d'occasion

ISBN: 1441945865

ID: 10913384

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test. used books,books Books, Springer

 Thriftbooks.com
used. Frais d'envoizzgl. Versandkosten., Livraison non-comprise
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

Détails sur le livre
Primality Testing and Integer Factorization in Public-Key Cryptography

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test.

Informations détaillées sur le livre - Primality Testing and Integer Factorization in Public-Key Cryptography


EAN (ISBN-13): 9781441945860
ISBN (ISBN-10): 1441945865
Version reliée
Livre de poche
Date de parution: 2010
Editeur: Springer-Verlag GmbH
392 Pages
Poids: 0,591 kg
Langue: eng/Englisch

Livre dans la base de données depuis 12.10.2011 23:05:44
Livre trouvé récemment le 12.02.2019 23:48:59
ISBN/EAN: 9781441945860

ISBN - Autres types d'écriture:
1-4419-4586-5, 978-1-4419-4586-0


< pour archiver...
Livres en relation