Sökning: "number field sieve"
Hittade 3 uppsatser innehållade orden number field sieve.
1. Integer factorization algorithms
Kandidat-uppsats, Umeå universitet/Institutionen för matematik och matematisk statistikSammanfattning : The mathematical area of integer factorization has gone a long way since the early days of Pierre de Fermat, and with simpler algorithms developed in the last century such as the Trial division and Pollards rho algorithm to the more complex method of the Quadratic sieve algorithm (QS), we have now arrived at the General Number Field Sieve (GNFS) which has been recognized as the fastest integer factorization algorithm for very large numbers. Today the research of integer factorization has many applications, among others in the security systems of encryption methods like the famous RSA algorithm. LÄS MER
2. Boosting SAT-solver Performance on FACT Instances with Automatic Parameter Tuning
Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : Previous work by Asketorp [2014] has shown that integer factorization with the best SAT-solvers is orders of magnitude slower then with general number field sieve (GNFS). However only default configurations for the tested SAT-solvers ware considered in thous tests therefor this rapport attempts to explore what difference use of good configurations would have made. LÄS MER
3. Distributed System for Factorisation of Large Numbers
Uppsats för yrkesexamina på grundnivå, Institutionen för systemteknikSammanfattning : 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. LÄS MER
