Re: Critiquing surrogate factoring
From: C. Bond (cbond_at_ix.netcom.com)
Date: 03/30/05
- Next message: Jean-Luc Cooke: "Re: Bruce Schneier's Applied Cryptography"
- Previous message: Craig Feinstein: "Re: 1wayfx challenge"
- In reply to: jstevh_at_msn.com: "Critiquing surrogate factoring"
- Next in thread: C. Bond: "Re: Critiquing surrogate factoring"
- Reply: C. Bond: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 30 Mar 2005 17:52:55 GMT
jstevh@msn.com wrote:
> The idea is simple enough, factor one number and use its factorization
> to get the factorization of another. The point being taking a number
> that is hard to factor, and yet, factoring it, by factoring an easier
> number.
>
> I thought it might help to try and write the the gist of it in a
> theorem.
>
> Surrogate Factoring Theorem:
>
> Given M, a target natural number to be factored, and j, an integer
> chosen such that j^2>M^2, a rational factor b_2 of M is given by
>
> b_2 f_1 = (-(Az - 2M^2)+/- sqrt((Az - 2M^2)^2 - 4TM^2))/2
>
> where T = M^2 - j^2, and f_1 is a rational factor of T, and where Az is
> given by
If j^2>M^2, as required above, then T is negative. Is that what you want?
-- There are two things you must never attempt to prove: the unprovable -- and the obvious. -- Democracy: The triumph of popularity over principle. -- http://www.crbond.com
- Next message: Jean-Luc Cooke: "Re: Bruce Schneier's Applied Cryptography"
- Previous message: Craig Feinstein: "Re: 1wayfx challenge"
- In reply to: jstevh_at_msn.com: "Critiquing surrogate factoring"
- Next in thread: C. Bond: "Re: Critiquing surrogate factoring"
- Reply: C. Bond: "Re: Critiquing surrogate factoring"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|