Investigation and implementation of some probabilistic algorithms

الموضوعات

علوم تطبيقية وتكنولوجية

الملخص

-Probabilistic algorithms were shown to be of importance after some fast polynomial time probabilistic solutions to some "hard" problems were given. In this thesis, theoretical foundations of probabilistic algorithms are studied. Probabilistic solutions to some "hard" problems are studied and investigated. Also probabilistic algorithms for some "easy problems" are studied and presented. The main concentration is on the probabilistic solutions to primality testing. The probability of a composite integer passing the Fermat test is derived. This includes an upper bound on the probability of a given integer being a Carmichael number. Three applications of this work are given as follows: 1. Using the pseduoprimlity test alone to test for primality. 2. Using the pseduoprimlity test with the Rabin test to test for Carmichael numbers. 3. Using the pseduoprimality test to generate keys for the Pohlig-Hellman encryption scheme.

روابط وملفات

التعريف والنوع

رقم الوثيقة

01c94bd7-2efc-4d1a-9e0d-ac657635949a

رقم العقد

0

نوع الوسائط

Crawler

نوع المحتوى

الرسائل العلمية

صيغة المصدر

رسائل ماجيستير

نوع الملف

pdf image

أسماء الملفات

850304_1.pdf

بيانات النشر

ترجمة العنوان

بحث وتنفيذ بعض الخوارزميات الاحتمالية

ألقاب المؤلفين

[{"name_ar":"Ahmad Said Ghazal ","title_ar":"اعداد","title_en":"Preparation"},{"name_ar":"Mohammed Al-Suwaiyel ","title_ar":"اشراف","title_en":"Supervision"}]

اللغة

English

المصدر والدورية

اسم المصدر

Investigation and implementation of some probabilistic algorithms

المحتوى والصفحات

عدد الصفحات

0

كلمات الباحثين

probabilistic algorithms, primality testing, Fermat test, Carmichael numbers, pseudoprimality test, Rabin test, Pohlig–Hellman encryption, polynomial-time algorithms, theoretical computer science

إشراف وإعداد

الإشراف

Mohammed Al-Suwaiyel

الإعداد

Ahmad Said Ghazal

الاقتباسات الببليوغرافية