Author Type

Graduate Student

Date of Award

2000

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Hoffman, Frederick

Abstract

In this thesis two different types of computer algorithms, Deterministic and Monte Carlo, are illustrated. Implementations of the Berlekamp-Massey algorithm and the Parallelized Pollard Rho Search are described here. The questions of what these two algorithms provide to the field of cryptography and why they have proven themselves important to cryptography are briefly discussed. It is also shown that with a little extra knowledge, the Parallelized Pollard Rho Search may be easily modified to improve its performance.

Extent

43 p.

Comments

Thesis (M.S.)--Florida Atlantic University, 2000.|Thesis (M.S.)--Florida Atlantic University, 2000.

Identifier

FADT12687

Format

pdf

Share

COinS