Distributed System for Factorisation of Large Numbers
Independent thesis Basic level (professional degree)Student thesis
This thesis aims at implementing methods for factorisation of large numbers. Seeing that there is no deterministic algorithm for finding the prime factors of a given number, the task proves rather difficult. Luckily, there have been developed some effective probabilistic methods since the invention of the computer so that it is now possible to factor numbers having about 200 decimal digits. This however consumes a large amount of resources and therefore, virtually all new factorisations are achieved using the combined power of many computers in a distributed system.
The nature of the distributed system can vary. The original goal of the thesis was to develop a client/server system that allows clients to carry out a portion of the overall computations and submit the result to the server.
Methods for factorisation discussed for implementation in the thesis are: the quadratic sieve, the number field sieve and the elliptic curve method. Actually implemented was only a variant of the quadratic sieve: the multiple polynomial quadratic sieve (MPQS).
Place, publisher, year, edition, pages
Institutionen för systemteknik , 2004. , 114 p.
Informationsteknik, factorisation, factorization, prime factor, quadratic sieve, QS, MPQS, number field sieve, elliptic curve method
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-1883OAI: oai:DiVA.org:liu-1883DiVA: diva2:19210