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!
|
Table of Contents:
- Frontmatter
- Table of Contents
- Overview and Usage Guide
- Mini-Courses
- Acknowledgments
- Preliminaries
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11
- Lecture 12
- Lecture 13
- Lecture 14
- Lecture 15
- Lecture 16
- Lecture 17
- Lecture 18
- List of Exercises and Research Problems
- List of Primary Results
- Credits and History
- References
- Notation