Re: Basically a sieve method, relation to quantum
From: Tim Peters (tim.one_at_comcast.net)
Date: 01/23/05
- Next message: Tim Peters: "Re: Factoring problem, solved"
- Previous message: Mok-Kong Shen: "Re: [Lit.] Buffer overruns"
- In reply to: jstevh_at_msn.com: "Re: Basically a sieve method, relation to quantum"
- Next in thread: David C. Ullrich: "Re: Basically a sieve method, relation to quantum"
- Reply: David C. Ullrich: "Re: Basically a sieve method, relation to quantum"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 22 Jan 2005 19:25:31 -0500
[jstevh@msn.com]
...
> To factor an RSA challenge number I'd need a full factorization of some
> number off of it. Now T = M^2 - j^2, where M is the target number, and
> j is a number you get to pick.
That's where you often get off track, failing to engage your full abilities.
What you want instead is a method that will factor M given a factorization
of T = M+j, where j is a number you get to pick. For example, pick j=0, and
then your algorithm will run in linear time. Picking j=0 in T=M^2-j^2 is
good too, but then you're left with tedious work to weed out the repeated
factors. Set your goal higher.
- Next message: Tim Peters: "Re: Factoring problem, solved"
- Previous message: Mok-Kong Shen: "Re: [Lit.] Buffer overruns"
- In reply to: jstevh_at_msn.com: "Re: Basically a sieve method, relation to quantum"
- Next in thread: David C. Ullrich: "Re: Basically a sieve method, relation to quantum"
- Reply: David C. Ullrich: "Re: Basically a sieve method, relation to quantum"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
Loading