Εξώφυλλο από Amazon.com
Distributed Programming Paradigms with Cryptography Applications Jonathan S. Greenfield
Τύπος υλικού:
ΚείμενοΣειρά: Lecture Notes in Computer Science. 870Λεπτομέρειες δημοσίευσης: Berlin Springer - Verlag 1994Περιγραφή: xi, 182 p., fig., tabISBN: - 3 540 58496 X
Ελλιπή περιεχόμενα:
contents: 1.Overview, 2.The RSA public-key cryptosystem, 3.Notation for distributed algorithms, 4.The competing servers array, 5.A distributed algorithm to find safe RSA keys, 6.Distributed factoring with competing servers, 7.The synchronized servers pipeline, 8.Message block chaining for distributed RSA enciphering, 9.Generating deterministically certified primes, Appendix 1:A proof of Lucas' theorem, Appendix 2:Multiple_length arithmetic, Appendix 3:Strong prime generation, Appendix 4:Pollard p-1 factoring, Appendix 5:RSA enciphering, Appendix 6:RSA deciphering, Appendix 7:Deterministic prime certification, Bibliography, Index, LIst of figures, List of tables, List of algorithms.
| Τύπος τεκμηρίου | Τρέχουσα βιβλιοθήκη | Ταξιθετικός αριθμός | Αριθμός αντιτύπου | Κατάσταση | Ημερομηνία λήξης | Ραβδοκώδικας |
|---|---|---|---|---|---|---|
| Μηχανικών Η/Υ και Πληροφορικής | 1 | Διαθέσιμο |
Bibliography pp. 167-173, Index pp. 175-176
contents: 1.Overview, 2.The RSA public-key cryptosystem, 3.Notation for distributed algorithms, 4.The competing servers array, 5.A distributed algorithm to find safe RSA keys, 6.Distributed factoring with competing servers, 7.The synchronized servers pipeline, 8.Message block chaining for distributed RSA enciphering, 9.Generating deterministically certified primes, Appendix 1:A proof of Lucas' theorem, Appendix 2:Multiple_length arithmetic, Appendix 3:Strong prime generation, Appendix 4:Pollard p-1 factoring, Appendix 5:RSA enciphering, Appendix 6:RSA deciphering, Appendix 7:Deterministic prime certification, Bibliography, Index, LIst of figures, List of tables, List of algorithms.
