Date of Publication

11-29-2007

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Numerical Analysis and Scientific Computing

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Jose Ronello T. Bartolome

Defense Panel Chair

Nelson Marcos

Defense Panel Member

Rigan P. Ap-Apid
Jose Ronello T. Bartolome

Abstract/Summary

Security of various cryptosystems like the RSA system largely depends on the difficulty of integer factorization. Because of this, innumerable amount of study has given focus to this field. Over the years, many algorithms have been designed to tackle factorization of integers that have reached past hundreds of decimal digits. More so, the need to factor such integers in the least possible amount of time is important. Since there exists various algorithms to choose from, we need a way to figure out which algorithm is the best given an integer. This research aims to design a polyalgorithm that, given a certain integer, will automatically determine which factorization method will give the best time related performance. Keywords: Integer Factorization, Public Key Cryptosystems, Factoring Algorithms, Prime Factorization, Number Theory.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG04304

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

vi, 141 leaves, 28 cm.

Keywords

Factorization (Mathematics); Public key cryptography; Algorithms; Number theory

Upload Full Text

wf_yes

Download

Share

COinS