Pseudorandomness and Cryptographic Applications

Michael Luby

$160

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Princeton University Pres
09 April 1996

Mathematics & Sciences; Data encryption; Mathematical theory of computation

Series: Princeton Computer Science Notes

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.

By: Michael Luby
Imprint: Princeton University Pres
Country of Publication: United States
Dimensions: Height: 254mm, Width: 197mm, Spine: 14mm
Weight: 369g
ISBN: 9780691025469
ISBN 10: 0691025460
Series: Princeton Computer Science Notes
Pages: 248
Publication Date: 09 April 1996
Audience: Professional and scholarly , College/higher education , Undergraduate , Primary
Format: Paperback
Publisher's Status: Active

Michael Luby is the Leader of the Theory Group and a Research Scientist at the International Computer Science Institute in Berkeley, California. He is also an Adjunct Professor in the Computer Science Division at the University of California, Berkeley.

ONLY $9.90 DELIVERY INFO

Pseudorandomness and Cryptographic Applications

Michael Luby

$160

Paperback

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S