Pythia: A polyalgorithm oracle for factoring integers
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2007
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3530 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=10368&context=etd_masteral |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|