Français
France
s'inscrire
Conseils d'eurolivre.fr
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
Livre conseillé
Actualités
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 27,78 €, prix le plus élevé: 61,00 €, prix moyen: 46,77 €
Pseudorandomness &Amp; Cryptographic Applications - Luby, Michael; Luby
Livre non disponible
(*)
Luby, Michael; Luby:
Pseudorandomness &Amp; Cryptographic Applications - nouveau livre

1996, ISBN: 0691025460, Lieferbar binnen 4-6 Wochen Frais d'envoiVersandkostenfrei innerhalb der BRD

ID: 9780691025469

Internationaler Buchtitel. In englischer Sprache. Verlag: PRINCETON UNIV PR, 256 Seiten, L=234mm, B=154mm, H=18mm, Gew.=386gr, [GR: 16300 - HC/Informatik/EDV], [SW: - Computers - Computer Security], Kartoniert/Broschiert, Klappentext: A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs. A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.

Nouveaux livres DEU
Buchgeier.com
Lieferbar binnen 4-6 Wochen (Besorgungstitel) Frais d'envoiVersandkostenfrei innerhalb der BRD
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Pseudorandomness and Cryptographic Applications
Livre non disponible
(*)
Pseudorandomness and Cryptographic Applications - livre d'occasion

ISBN: 9780691025469

ID: 9780691025469

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs. Books, Mathematics~~Applied, Pseudorandomness-and-Cryptographic-Applications~~Michael-Luby, , , , , , , , , , Princeton University Press

livre d'occasion Barnesandnoble.com
MPN: , SKU 9780691025469 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.
Pseudorandomness &Amp; Cryptographic Applications (Princeton Computer Science Notes) - Michael Luby, Luby
Livre non disponible
(*)
Michael Luby, Luby:
Pseudorandomness &Amp; Cryptographic Applications (Princeton Computer Science Notes) - Livres de poche

ISBN: 0691025460

[SR: 582001], Taschenbuch, [EAN: 9780691025469], Princeton Univ Pr, Princeton Univ Pr, Book, [PU: Princeton Univ Pr], Princeton Univ Pr, Pseudorandomness and Cryptographic Applications, by Michael Luby, presents the mathematical underpinnings of one-way hash functions, which can be used to implement pseudorandom number generators. (These have a wide array of applications in cryptography.) After covering these basic mathematical ideas, the author delves into their applications in cryptosystems. Organized in 18 lectures, this book provides a mathematically intense treatise on the subject without much commentary in between. A set of exercises accompanies each chapter and a bibliography concludes the text. Filled with elegant mathematics, this is clearly a book for academic specialists., 377663011, Sicherheit & Verschlüsselung, 62991011, Computer & Internet, 54071011, Genres, 52044011, Fremdsprachige Bücher, 56248011, Angewandte Mathematik, 56261011, Biomathematik, 1320305031, Computermathematik, 56251011, Differentialgleichung, 56252011, Graphentheorie, 56253011, Lineare Programmierung, 56256011, Maschinenbau & Technik, 56181011, Spieltheorie, 56255011, Vektoranalyse, 56254011, Wahrscheinlichkeit & Statistik, 56214011, Mathematik, 56047011, Fachbücher, 54071011, Genres, 52044011, Fremdsprachige Bücher

Nouveaux livres Amazon.de (Intern...
---SuperBookDeals---
Neuware Frais d'envoiInnerhalb EU, Schweiz und Liechtenstein (soferne Lieferung möglich) (EUR 3.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Pseudorandomness &Amp; Cryptographic Applications (Princeton Computer Science Notes) - Michael Luby, Luby
Livre non disponible
(*)
Michael Luby, Luby:
Pseudorandomness &Amp; Cryptographic Applications (Princeton Computer Science Notes) - Livres de poche

ISBN: 0691025460

[SR: 582001], Taschenbuch, [EAN: 9780691025469], Princeton Univ Pr, Princeton Univ Pr, Book, [PU: Princeton Univ Pr], Princeton Univ Pr, Pseudorandomness and Cryptographic Applications, by Michael Luby, presents the mathematical underpinnings of one-way hash functions, which can be used to implement pseudorandom number generators. (These have a wide array of applications in cryptography.) After covering these basic mathematical ideas, the author delves into their applications in cryptosystems. Organized in 18 lectures, this book provides a mathematically intense treatise on the subject without much commentary in between. A set of exercises accompanies each chapter and a bibliography concludes the text. Filled with elegant mathematics, this is clearly a book for academic specialists., 377663011, Sicherheit & Verschlüsselung, 62991011, Computer & Internet, 54071011, Genres, 52044011, Fremdsprachige Bücher, 56248011, Angewandte Mathematik, 56261011, Biomathematik, 1320305031, Computermathematik, 56251011, Differentialgleichung, 56252011, Graphentheorie, 56253011, Lineare Programmierung, 56256011, Maschinenbau & Technik, 56181011, Spieltheorie, 56255011, Vektoranalyse, 56254011, Wahrscheinlichkeit & Statistik, 56214011, Mathematik, 56047011, Fachbücher, 54071011, Genres, 52044011, Fremdsprachige Bücher

livre d'occasion Amazon.de (Intern...
EliteDigital DE
Gebraucht Frais d'envoiInnerhalb EU, Schweiz und Liechtenstein (soferne Lieferung möglich) (EUR 3.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Pseudorandomness and Cryptographic Applications - Michael Luby
Livre non disponible
(*)
Michael Luby:
Pseudorandomness and Cryptographic Applications - nouveau livre

ISBN: 9780691025469

ID: 475126135

NA Cryptographic, Princeton University Press

Nouveaux livres Printsasia
new 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
Pseudorandomness &Amp; Cryptographic Applications

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.

Informations détaillées sur le livre - Pseudorandomness &Amp; Cryptographic Applications


EAN (ISBN-13): 9780691025469
ISBN (ISBN-10): 0691025460
Livre de poche
Date de parution: 1996
Editeur: PRINCETON UNIV PR
256 Pages
Poids: 0,386 kg
Langue: eng/Englisch

Livre dans la base de données depuis 05.04.2007 16:35:16
Livre trouvé récemment le 14.11.2015 02:33:19
ISBN/EAN: 0691025460

ISBN - Autres types d'écriture:
0-691-02546-0, 978-0-691-02546-9


< pour archiver...
Livres en relation