On April 27, 2011, 11:14 p.m.
I found Fermats Factorizing algorithem Wich should be eficcent for P and Q if they are the same size I Tested my Software with small N and it worked . But the …
Posts
Topics
On April 27, 2011, 11:14 p.m.
I found Fermats Factorizing algorithem Wich should be eficcent for P and Q if they are the same size I Tested my Software with small N and it worked . But the …
On April 16, 2011, 8:49 p.m.
I played a littel bit with some Prime numbers and found this as closer p and q get to each other as closer one of the factors ist near by the root of N ist thi…
On March 30, 2011, 11:58 p.m.
Is there anny way to avoid a Quadratic sive ?
My first Idea is maby N has a small primefactor
I tried to look for a Prime divisor without a remainder I …