Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interp
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
✍ Scribed by Oded Goldreich (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 1999
- Tongue
- English
- Leaves
- 191
- Series
- Algorithms and Combinatorics 17
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas cinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity theory at large. Specifically, the interplay of randomness and computation is pivotal to several intriguing notions of probabilistic proof systems and is the focal of the computational approach to randomness. This book provides an introduction to these three, somewhat interwoven domains (i.e., cryptography, proofs and randomness). Modern Cryptography. Whereas classical cryptography was confined to the art of designing and breaking encryption schemes (or "secrecy codes"), Modern Cryptography is concerned with the rigorous analysis of any system which should withstand malicious attempts to abuse it. We emphasize two aspects of the transition from classical to modern cryptography: ( 1) the wide ning of scope from one specific task to an utmost wide general class of tasks; and (2) the move from an engineering-art which strives on ad-hoc tricks to a scientific discipline based on rigorous approaches and techniques.
✦ Table of Contents
Front Matter....Pages I-XV
The Foundations of Modern Cryptography....Pages 1-37
Probabilistic Proof Systems....Pages 39-72
Pseudorandom Generators....Pages 73-106
Back Matter....Pages 107-183
✦ Subjects
Combinatorics; Data Encryption; Probability Theory and Stochastic Processes; Mathematics of Computing; Theory of Computation
📜 SIMILAR VOLUMES
Криптография, вероятностные доказательства и псевдослучайные процессы в теории вычислительной техники
Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interp
<p>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
<p><P>The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation.</P><P>Key topics and features:</P><P>- various lower bounds on the complexity of some number theoretic and cryptographic problems, assoc