Pseudorandomness and Cryptographic Applications / / Michael Luby.
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...
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2019] ©1996 |
| Year of Publication: | 2019 |
| Language: | English |
| Series: | Princeton Computer Science Notes ;
1 |
| Online Access: | |
| Physical Description: | 1 online resource (248 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 04134nam a22006975i 4500 | ||
|---|---|---|---|
| 001 | 9780691206844 | ||
| 003 | DE-B1597 | ||
| 005 | 20210830012106.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 210830t20191996nju fo d z eng d | ||
| 020 | |a 9780691206844 | ||
| 024 | 7 | |a 10.1515/9780691206844 |2 doi | |
| 035 | |a (DE-B1597)544980 | ||
| 035 | |a (OCoLC)1143825740 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a nju |c US-NJ | ||
| 050 | 4 | |a QA298 |b .L83 1996eb | |
| 072 | 7 | |a MAT003000 |2 bisacsh | |
| 082 | 0 | 4 | |a 005.8/2 |2 22 |
| 100 | 1 | |a Luby, Michael, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Pseudorandomness and Cryptographic Applications / |c Michael Luby. |
| 264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2019] | |
| 264 | 4 | |c ©1996 | |
| 300 | |a 1 online resource (248 p.) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 0 | |a Princeton Computer Science Notes ; |v 1 | |
| 505 | 0 | 0 | |t Frontmatter -- |t Table of Contents -- |t Overview and Usage Guide -- |t Mini-Courses -- |t Acknowledgments -- |t Preliminaries -- |t Lecture 1 -- |t Lecture 2 -- |t Lecture 3 -- |t Lecture 4 -- |t Lecture 5 -- |t Lecture 6 -- |t Lecture 7 -- |t Lecture 8 -- |t Lecture 9 -- |t Lecture 10 -- |t Lecture 11 -- |t Lecture 12 -- |t Lecture 13 -- |t Lecture 14 -- |t Lecture 15 -- |t Lecture 16 -- |t Lecture 17 -- |t Lecture 18 -- |t List of Exercises and Research Problems -- |t List of Primary Results -- |t Credits and History -- |t References -- |t Notation |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |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. 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. | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Data encryption (Computer science). | |
| 650 | 0 | |a Numbers, Random. | |
| 650 | 0 | |a Random number generators. | |
| 650 | 7 | |a MATHEMATICS / Applied. |2 bisacsh | |
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton University Press eBook-Package Archive 1927-1999 |z 9783110442496 |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9780691206844?locatt=mode:legacy |
| 856 | 4 | 0 | |u https://www.degruyter.com/isbn/9780691206844 |
| 856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/cover/covers/9780691206844.jpg |
| 912 | |a 978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999 |c 1927 |d 1999 | ||
| 912 | |a EBA_BACKALL | ||
| 912 | |a EBA_CL_MTPY | ||
| 912 | |a EBA_EBACKALL | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_MTPY | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_PPALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||