Digital Repository

The Number Field Sieve Factoring Algorithm

Show simple item record

dc.contributor.advisor MAHALANOBIS, AYAN
dc.contributor.author KUMAR, RAHUL
dc.date.accessioned 2022-09-14T06:20:13Z
dc.date.available 2022-09-14T06:20:13Z
dc.date.issued 2012-04
dc.identifier.citation 52 en_US
dc.identifier.uri http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/7362
dc.description.abstract Integer factorization has been interesting problem for mathematicians since centuries. Integer factorisation lies in the heart of Number Theory. There has been many algorithms for factorisation such as Dixon’s factorisation, continued fractions and Quadratic Sieve Factoring Algorithm. Many of the encryption algorithms in cryptog- raphy are based on the “hardness” in factoring large composite numbers with no small prime factors Number Field Sieve is the best known factoring algorithm. It works best with large numbers, for small one Quadratic Sieve is the best algorithm because of its low requirement of storage. Time complexity of GNFS (General Number Field q ](explanation of L-notation is given in appendix) and Sieving) algorithm is L n [ 13 , 3 643 that of quadratic sieve algorithm is L n [ 12 , 1]. en_US
dc.language.iso en en_US
dc.subject Integer factorization en_US
dc.subject Number Field en_US
dc.subject Sieve Factoring Algorithm en_US
dc.subject Quadratic Sieve Factoring Algorithm en_US
dc.title The Number Field Sieve Factoring Algorithm en_US
dc.type Thesis en_US
dc.description.embargo no embargo en_US
dc.type.degree BS-MS en_US
dc.contributor.department Dept. of Mathematics en_US
dc.contributor.registration 20071012 en_US


Files in this item

This item appears in the following Collection(s)

  • MS THESES [1705]
    Thesis submitted to IISER Pune in partial fulfilment of the requirements for the BS-MS Dual Degree Programme/MSc. Programme/MS-Exit Programme

Show simple item record

Search Repository


Advanced Search

Browse

My Account