| dc.contributor.advisor | Veni Madhavan, C E | |
| dc.contributor.author | Chander, Sivasankar | |
| dc.date.accessioned | 2025-10-30T10:57:34Z | |
| dc.date.available | 2025-10-30T10:57:34Z | |
| dc.date.submitted | 1993 | |
| dc.identifier.uri | https://etd.iisc.ac.in/handle/2005/7276 | |
| dc.description.abstract | Integer Factorization is an old problem in Number Theory, which has long been regarded as a fundamentally difficult problem. Since 1970, there have been substantial advances in integer factorization. A number of algorithms have been developed for the factorization of moderate to large-sized integers with exponential and sub-exponential run times.
This report describes the principles and implementation of a few of these recent algorithms on a general-purpose time-shared minicomputer, and some results obtained using the implementation. | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | T03517 | |
| dc.rights | I grant Indian Institute of Science the right to archive and to make available my thesis or dissertation in whole or in part in all forms of media, now hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation | |
| dc.subject | Integer Factorization Algorithms | |
| dc.subject | Sub-exponential Methods | |
| dc.subject | Minicomputer Implementation | |
| dc.title | Integer factorization algorithms | |
| dc.degree.name | MSc Engg | |
| dc.degree.level | Masters | |
| dc.degree.grantor | Indian Institute of Science | |
| dc.degree.discipline | Engineering | |
