A Primer on Pseudorandom Generators

A Primer on Pseudorandom Generators

まだ評価がありません
2010 · 英語 · ペーパーバック
棚に追加

この本を評価する


ブックジャーナルをエクスポート

説明

A fresh look at the question of randomness was taken in the theory of A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography. This primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and

本の詳細

形式 ペーパーバック
ページ数 114ページ
言語 英語
公開されました 8月 9, 2010
出版社 American Mathematical Society
ISBN-10 0821851926
ISBN-13 9780821851920

ジャンル

棚に追加

この本を評価する


ブックジャーナルをエクスポート