Note
Thesis (M.S.)--Florida Atlantic University, 2000.
Member of
Contributors
Publisher
Florida Atlantic University
Date Issued
2000
Description
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.
Language
Type
Form
Extent
43 p.
Subject (Topical)
Identifier
9780599813786
ISBN
9780599813786
Additional Information
Thesis (M.S.)--Florida Atlantic University, 2000.
Date Backup
2000
Date Text
2000
Date Issued (EDTF)
2000
Extension
FAU
FAU
admin_unit="FAU01", ingest_id="ing1508", creator="staff:fcllz", creation_date="2007-07-18 21:43:59", modified_by="staff:fcllz", modification_date="2011-01-06 13:08:43"
IID
FADT12687
Issuance
monographic
Organizations
Attributed name: Florida Atlantic University
Person Preferred Name
McPherson, Joe Cullen
Graduate College
Physical Description
43 p.
application/pdf
Title Plain
Examples of deterministic and Monte Carlo algorithms for cryptographic applications
Use and Reproduction
Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
http://rightsstatements.org/vocab/InC/1.0/
Origin Information
2000
monographic
Boca Raton, Fla.
Florida Atlantic University
Physical Location
Florida Atlantic University Libraries
Place
Boca Raton, Fla.
Sub Location
Digital Library
Title
Examples of deterministic and Monte Carlo algorithms for cryptographic applications
Other Title Info
Examples of deterministic and Monte Carlo algorithms for cryptographic applications