Pseudorandomness and Cryptographic Applications (eBook)

Michael Luby (Autor)

eBook Download: PDF

2019
248 Seiten
Princeton University Press (Verlag)
978-0-691-20684-4 (ISBN)

Infos

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "e;looks"e; 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.

Produkt-Details

• Erscheint lt. Verlag: 31.12.2019
• Reihe/Serie: Princeton Computer Science Notes
• Reihe/Serie: Princeton Computer Science Notes
• Sprache: englisch
• Themenwelt: Informatik ► Theorie / Studium ► Kryptologie
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Schlagworte: algorithm • Alice and Bob • Best, worst and average case • Binary number • Bit • boolean satisfiability problem • Calculation • Chernoff bound • ciphertext • Complexity class • computable function • Computation • Computational indistinguishability • Computational problem • Computational resource • Computer data storage • computing • conjecture • Coprime integers • Cryptographic primitive • cryptographic protocol • cryptography • cryptosystem • Data Encryption Standard • Deterministic Simulation • digital signature • discrete logarithm • Division by zero • E8 (mathematics) • Encryption • Factorization • Fermat's Last Theorem • Function (mathematics) • Graham's number • Graph isomorphism problem • Hadamard matrix • hash function • Independence (probability theory) • Initialization (programming) • Inner product space • Instance (computer science) • Integer Factorization • Interactive proof system • Inverse function • Jacobi symbol • key generation • Kullback–Leibler divergence • Lecture • Linear congruential generator • Linear number • logarithm • logarithmic • Mathematical Induction • Memory protection • np-completeness • One-time Pad • one-way function • pairwise • Pairwise independence • Parameter (computer programming) • Permutation • Plaintext • prime factor • Prime number • probabilistic encryption • Probability • Probability Distribution • Probability space • pseudorandom generator • Pseudorandomness • Public-Key Cryptography • P versus NP problem • Quadratic residuosity problem • random function • randomized algorithm • Randomness Tests • random number generation • random permutation • Random Variable • Restriction (mathematics) • result • Ron Rivest • Sanjeev Arora • scientific notation • Security parameter • Special case • State (computer science) • Stationary ergodic process • Statistical hypothesis testing • Subset sum problem • Symmetric-key algorithm • Theorem • time complexity • Turing Machine • Uniform distribution (discrete) • universal hashing • Universal one-way hash function • Variable (mathematics) • zero-knowledge proof • ZPP (complexity)
• ISBN-10: 0-691-20684-8 / 0691206848
• ISBN-13: 978-0-691-20684-4 / 9780691206844