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!
|
id |
9780691206844 |
---|---|
ctrlnum |
(DE-B1597)544980 (OCoLC)1143825740 |
collection |
bib_alma |
record_format |
marc |
spelling |
Luby, Michael, author. aut http://id.loc.gov/vocabulary/relators/aut Pseudorandomness and Cryptographic Applications / Michael Luby. Princeton, NJ : Princeton University Press, [2019] ©1996 1 online resource (248 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Princeton Computer Science Notes ; 1 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 restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Computational complexity. Data encryption (Computer science). Numbers, Random. Random number generators. MATHEMATICS / Applied. bisacsh Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 9783110442496 https://doi.org/10.1515/9780691206844?locatt=mode:legacy https://www.degruyter.com/isbn/9780691206844 Cover https://www.degruyter.com/cover/covers/9780691206844.jpg |
language |
English |
format |
eBook |
author |
Luby, Michael, Luby, Michael, |
spellingShingle |
Luby, Michael, Luby, Michael, Pseudorandomness and Cryptographic Applications / Princeton Computer Science Notes ; 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 |
author_facet |
Luby, Michael, Luby, Michael, |
author_variant |
m l ml m l ml |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Luby, Michael, |
title |
Pseudorandomness and Cryptographic Applications / |
title_full |
Pseudorandomness and Cryptographic Applications / Michael Luby. |
title_fullStr |
Pseudorandomness and Cryptographic Applications / Michael Luby. |
title_full_unstemmed |
Pseudorandomness and Cryptographic Applications / Michael Luby. |
title_auth |
Pseudorandomness and Cryptographic Applications / |
title_alt |
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 |
title_new |
Pseudorandomness and Cryptographic Applications / |
title_sort |
pseudorandomness and cryptographic applications / |
series |
Princeton Computer Science Notes ; |
series2 |
Princeton Computer Science Notes ; |
publisher |
Princeton University Press, |
publishDate |
2019 |
physical |
1 online resource (248 p.) |
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 |
isbn |
9780691206844 9783110442496 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA298 |
callnumber-sort |
QA 3298 L83 41996EB |
url |
https://doi.org/10.1515/9780691206844?locatt=mode:legacy https://www.degruyter.com/isbn/9780691206844 https://www.degruyter.com/cover/covers/9780691206844.jpg |
illustrated |
Not Illustrated |
dewey-hundreds |
000 - Computer science, information & general works |
dewey-tens |
000 - Computer science, knowledge & systems |
dewey-ones |
005 - Computer programming, programs & data |
dewey-full |
005.8/2 |
dewey-sort |
15.8 12 |
dewey-raw |
005.8/2 |
dewey-search |
005.8/2 |
doi_str_mv |
10.1515/9780691206844?locatt=mode:legacy |
oclc_num |
1143825740 |
work_keys_str_mv |
AT lubymichael pseudorandomnessandcryptographicapplications |
status_str |
n |
ids_txt_mv |
(DE-B1597)544980 (OCoLC)1143825740 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
is_hierarchy_title |
Pseudorandomness and Cryptographic Applications / |
container_title |
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 |
_version_ |
1770176320695697408 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04134nam a22006975i 4500</leader><controlfield tag="001">9780691206844</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20191996nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691206844</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691206844</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)544980</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1143825740</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA298</subfield><subfield code="b">.L83 1996eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">005.8/2</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Luby, Michael, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Pseudorandomness and Cryptographic Applications /</subfield><subfield code="c">Michael Luby.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (248 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Computer Science Notes ;</subfield><subfield code="v">1</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Table of Contents -- </subfield><subfield code="t">Overview and Usage Guide -- </subfield><subfield code="t">Mini-Courses -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">Preliminaries -- </subfield><subfield code="t">Lecture 1 -- </subfield><subfield code="t">Lecture 2 -- </subfield><subfield code="t">Lecture 3 -- </subfield><subfield code="t">Lecture 4 -- </subfield><subfield code="t">Lecture 5 -- </subfield><subfield code="t">Lecture 6 -- </subfield><subfield code="t">Lecture 7 -- </subfield><subfield code="t">Lecture 8 -- </subfield><subfield code="t">Lecture 9 -- </subfield><subfield code="t">Lecture 10 -- </subfield><subfield code="t">Lecture 11 -- </subfield><subfield code="t">Lecture 12 -- </subfield><subfield code="t">Lecture 13 -- </subfield><subfield code="t">Lecture 14 -- </subfield><subfield code="t">Lecture 15 -- </subfield><subfield code="t">Lecture 16 -- </subfield><subfield code="t">Lecture 17 -- </subfield><subfield code="t">Lecture 18 -- </subfield><subfield code="t">List of Exercises and Research Problems -- </subfield><subfield code="t">List of Primary Results -- </subfield><subfield code="t">Credits and History -- </subfield><subfield code="t">References -- </subfield><subfield code="t">Notation</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data encryption (Computer science).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Numbers, Random.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Random number generators.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="z">9783110442496</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691206844?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9780691206844</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9780691206844.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="c">1927</subfield><subfield code="d">1999</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |