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 صفحات
لغة الإنجليزية
منشور أغسطس 9, 2010
الناشر American Mathematical Society
رقم ISBN-10 0821851926
رقم ISBN-13 9780821851920
أضف إلى الرف

قيم هذا الكتاب


تصدير مجلة الكتاب