itSik 2009, projektopgave
En undersøgelse af faktoriseringsalgoritmen Pollard p-1
Torsten Jordt, 19751241

Implementeringer (java)

AnalyzeIntervalStrategy.java - A check which which analyzes the iteration a <- a^j mod n
Common.java - Trivial factoring. Contains also (not very fast) helper methods to be used in analysis of implementations
Factoring.java - The essential interface for factoring a number in general
Pollard_p_1.java - The essential interface for factoring a number by means of Pollard p-1
Pollard_p_1_aB.java - Based on Stinson's algorithm. B may be iteratively computed. If a=1 attempt to factor from the previous value of a.
Pollard_p_1_Ardoino.java - Factoring using Paolo Ardoino's Pollard p-1 implementation
Pollard_p_1_B.java - Based on Stinson's algorithm. B is iteratively computed
Pollard_p_1_Native.java - A slight modification of Stinson's algorithm. Computes same results as Stinson's algorithm
Pollard_p_1_Stinson.java - Stinson's algorithm for factoring using Pollard p-1
Pollard_p_1_X1.java - An alternative version of Stinson’s algorithm
PrimeNumberGeneration.java - Generation of prime numbers and products of prime numbers


17.10.2009 14:16:33