Cargando…
Pseudorandomness and 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 cryptos...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton, NJ :
Princeton University Press,
c1996.
|
| Colección: | Princeton computer science notes.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | JSTOR_on1134769421 | ||
| 003 | OCoLC | ||
| 005 | 20231005004200.0 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 960305s1996 nju ob 001 0 eng | ||
| 010 | |a 2021698794 | ||
| 040 | |a DLC |b eng |e pn |c DLC |d MM9 |d UX1 |d JSTOR |d OCLCO |d OCL |d OCLCQ |d OCLCO | ||
| 019 | |a 1175624072 | ||
| 020 | |a 9780691206844 |q ebook | ||
| 020 | |a 0691206848 | ||
| 020 | |z 0691025460 | ||
| 020 | |z 9780691025469 | ||
| 029 | 1 | |a AU@ |b 000066461669 | |
| 035 | |a (OCoLC)1134769421 |z (OCoLC)1175624072 | ||
| 037 | |a 22573/ctvs5f9j6 |b JSTOR | ||
| 050 | 0 | 4 | |a QA298 |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 072 | 7 | |a COM |x 083000 |2 bisacsh | |
| 082 | 0 | 0 | |a 005.8/2 |2 20 |
| 084 | |a 30.10 |2 bcl | ||
| 084 | |a 31.73 |2 bcl | ||
| 084 | |a *94A60 |2 msc | ||
| 084 | |a 11K45 |2 msc | ||
| 084 | |a 68Q15 |2 msc | ||
| 084 | |a 94-01 |2 msc | ||
| 084 | |a 94A55 |2 msc | ||
| 088 | |a 96130688 | ||
| 049 | |a UAMI | ||
| 100 | 1 | |a Luby, Michael George. | |
| 245 | 1 | 0 | |a Pseudorandomness and cryptographic applications / |c Michael Luby. |
| 260 | |a Princeton, NJ : |b Princeton University Press, |c c1996. | ||
| 300 | |a 1 online resource (xvi, 234 p.) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Princeton computer science notes | |
| 504 | |a Includes bibliographical references (p. [211]-219) and index. | ||
| 588 | |a Description based on print version record and CIP data provided by publisher; resource not viewed. | ||
| 520 | 1 | |a "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."--BOOK JACKET. "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."--BOOK JACKET. "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."--Jacket | |
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 590 | |a JSTOR |b Books at JSTOR Evidence Based Acquisitions | ||
| 590 | |a JSTOR |b Books at JSTOR All Purchased | ||
| 650 | 0 | |a Random number generators. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Data encryption (Computer science) | |
| 650 | 0 | |a Numbers, Random. | |
| 650 | 0 | |a Cryptography. | |
| 650 | 6 | |a Générateurs de nombres aléatoires. | |
| 650 | 6 | |a Nombres aléatoires. | |
| 650 | 6 | |a Chiffrement (Informatique) | |
| 650 | 6 | |a Cryptographie. | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a Cryptography |2 fast | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Data encryption (Computer science) |2 fast | |
| 650 | 7 | |a Numbers, Random |2 fast | |
| 650 | 7 | |a Random number generators |2 fast | |
| 776 | 0 | 8 | |i Print version: |t Pseudorandomness and cryptographic applications |d Princeton, NJ : Princeton University Press, c1996. |z 0691025460 |w (DLC) 96130688 |
| 830 | 0 | |a Princeton computer science notes. | |
| 856 | 4 | 0 | |u https://jstor.uam.elogim.com/stable/10.2307/j.ctvs32rpn |z Texto completo |
| 994 | |a 92 |b IZTAP | ||