Modern cryptography, probabilistic proofs and pseudorandomness / Oded Goldreich (1999)

Public ISBD Titre : Modern cryptography, probabilistic proofs and pseudorandomness Type de document : texte imprimé Auteurs : Oded Goldreich, Auteur Editeur : Berlin ; London ; Cham : Springer Année de publication : 1999 Collection : Algorithms and combinatorics num. 17 Importance : IX-182 p. Format : 25 cm ISBN/ISSN/EAN : 978-3-540-64766-9 Note générale : Bibliogr. Index Langues : Anglais (eng) Mots-clés : Cryptographie Théorie de la démonstration Chiffrement (informatique) Fonctions pseudo-aléatoires Computer security Index. décimale : 681.3.053 Problèmes de la conversion,du codage et du décodage. Résumé : The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas. Note de contenu : - The Foundations of Modern Cryptography - Probabilistic Proof Systems - Pseudorandom Generators A: Background on Randomness and Computation B: Randomized Computations C: Two Proofs D: Related Surveys by the Author Modern cryptography, probabilistic proofs and pseudorandomness [texte imprimé] / Oded Goldreich, Auteur . - Berlin ; London ; Cham : Springer, 1999 . - IX-182 p. ; 25 cm. - (Algorithms and combinatorics; 17) . ISBN : 978-3-540-64766-9 Bibliogr. Index Langues : Anglais (eng) Mots-clés : Cryptographie Théorie de la démonstration Chiffrement (informatique) Fonctions pseudo-aléatoires Computer security Index. décimale : 681.3.053 Problèmes de la conversion,du codage et du décodage. Résumé : The book focuses on three related areas in the theory of computation. The areas are modern cryptography, the study of probabilistic proof systems, and the theory of computational pseudorandomness. The common theme is the interplay between randomness and computation. The book offers an introduction and extensive survey to each of these areas, presenting both the basic notions and the most important (sometimes advanced) results. The presentation is focused on the essentials and does not elaborate on details. In some cases it offers a novel and illuminating perspective. The reader may obtain from the book 1. A clear view of what each of these areas is all above. 2. Knowledge of the basic important notions and results in each area. 3. New insights into each of these areas. It is believed that the book may thus be useful both to a beginner (who has only some background in the theory of computing), and an expert in any of these areas. Note de contenu : - The Foundations of Modern Cryptography - Probabilistic Proof Systems - Pseudorandom Generators A: Background on Randomness and Computation B: Randomized Computations C: Two Proofs D: Related Surveys by the Author

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité	Etat_Exemplaire
046373	681.3.053 GOL	Papier	Bibliothèque Centrale	Informatique	Disponible