Factoring large N into prime factors

  • Thread starter bert2612
  • Start date
  • #1
5
0

Main Question or Discussion Point

Hi, I am writing up a project based on an algorithm for factoring large numbers, I have reached seemingly simple point where I am stuck, I wonder if anyone can help me?

I am trying to factor a large N such that N=pq for unknown primes p and q, I have described a method to find a value for (p-1)(q-1) from N and now have the problem of recovering p and q.

So N is given and (p-1)(q-1) is given, how do I carry on? Thanks
 

Answers and Replies

  • #3
5
0
thanks, that's perfect.

The way in which i found (p-1)(q-1) is to take a set of sequences of powers of x mod N for x=1,2,...,N-1 and work out their periods, each period turns out to be a divisor of (p-1)(q-1), if a large enough number of divisors is taken, then the value of (p-1)(q-1) can be predicted with high probability. That's basically all I've got, if anyone knows the specific theorem I am exploiting here it would be greatly appreciated as I should include it in my work, I know it's Euler but I'm having trouble finding a specific name so I can reference it and perhaps find a proof.
 

Related Threads on Factoring large N into prime factors

  • Last Post
Replies
6
Views
10K
Replies
3
Views
13K
  • Last Post
Replies
11
Views
2K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
7
Views
3K
Replies
19
Views
1K
  • Last Post
Replies
20
Views
9K
  • Last Post
Replies
3
Views
687
Replies
12
Views
3K
  • Last Post
Replies
6
Views
2K
Top