KFUPM ePrints

Investigation and implementation of some probabilistic algorithms.

Ghazal, Ahmad Said. (1988) Investigation and implementation of some probabilistic algorithms. Masters thesis, King Fahd University of Petroleum and Minerals.

[img]
Preview
PDF
2636Kb

Arabic Abstract

-

English Abstract

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.



Item Type:Thesis (Masters)
Date:June 1988
Date Type:Completion
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Information and Computer Science Dept
Creators:Ghazal, Ahmad Said.
Committee Advisor:Al-Suwaiyel, Mohammed
Committee Members:Khayat, Mohammad. and Walker, Peter
ID Code:9918
Deposited By:KFUPM ePrints Admin
Deposited On:22 Jun 2008 16:52
Last Modified:25 Apr 2011 09:40

Repository Staff Only: item control page