Re: Test for divisors of Phi(N)
From: Marcel Martin (mm_at_ellipsa.net)
Date: 08/02/03
- Next message: David Wagner: "Re: Test for divisors of Phi(N)"
- Previous message: Zulfikar Ramzan: "Re: Test for divisors of Phi(N)"
- In reply to: David Wagner: "Re: Test for divisors of Phi(N)"
- Next in thread: David Wagner: "Re: Test for divisors of Phi(N)"
- Reply: David Wagner: "Re: Test for divisors of Phi(N)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 02 Aug 2003 01:48:07 +0200
David Wagner a écrit :
> I'm not sure I understand. I believe the original poster asked about
> checking divisibility rather than computing phi(N) mod d.
>
> Suppose we had a test which, given N and d returned whether d divides
> phi(N). Then I believe there is no known way to use this to factor N.
>
> Did I miss something?
If you could collect enough D_i's, you could apply Silverman's idea
with phi(N) = 0 mod D_i.
One can think of other ways to attack N. For instance, if D divides
phi(N), there are elements of order D in Z/NZ. Collect enough D_i's
and try to find
a^(D_i*D_j*...*D_z) = 1 mod N
b^(D_i*D_j*...*D_z) = 1 mod N (with 1 < a < b)
then find some factors F_i's of
a^(D_i*D_j*...*D_z) - b^(D_i*D_j*...*D_z)
and look if gcd(F_i, N) gives a factor of N.
This works well with Carmichael numbers, but with them, it is not
difficult to find values a, b and k such that a^k = b^k = 1 :-)
Marcel Martin
- Next message: David Wagner: "Re: Test for divisors of Phi(N)"
- Previous message: Zulfikar Ramzan: "Re: Test for divisors of Phi(N)"
- In reply to: David Wagner: "Re: Test for divisors of Phi(N)"
- Next in thread: David Wagner: "Re: Test for divisors of Phi(N)"
- Reply: David Wagner: "Re: Test for divisors of Phi(N)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|