On Mon, Jun 8, 2009 at 11:51 AM, Victor Duchovni
wrote:
> On Sun, Jun 07, 2009 at 05:41:00PM -0700, Greg Perry wrote:
>
>> The significance of this method is the ability to determine any
>> properties of p and q from a simple operation to n.
>
> To be blunt, I see no significance of any kind...
>
On Sun, Jun 07, 2009 at 05:41:00PM -0700, Greg Perry wrote:
> The significance of this method is the ability to determine any
> properties of p and q from a simple operation to n.
To be blunt, I see no significance of any kind...
You have observed that unless N is divisible by 3, p and q are bot
On Sun, Jun 07, 2009 at 05:10:30PM +0100, Ben Laurie wrote:
> Paul Hoffman wrote:
> > At 8:07 PM -0700 6/5/09, Greg Perry wrote:
> >> Greetings list members,
> >>
> >> I have published a unique factoring method related to Pollard's Rho
> >> that is published here:
> >>
> >> http://blog.liveammo.
Paul Hoffman wrote:
> At 8:07 PM -0700 6/5/09, Greg Perry wrote:
>> Greetings list members,
>>
>> I have published a unique factoring method related to Pollard's Rho
>> that is published here:
>>
>> http://blog.liveammo.com/2009/06/factoring-fun/
>>
>> Any feedback would be appreciated.
>
> Is
On Fri, Jun 05, 2009 at 08:07:21PM -0700, Greg Perry wrote:
> I have published a unique factoring method related to Pollard's Rho that
> is published here:
>
> http://blog.liveammo.com/2009/06/factoring-fun/
Several aspects of the RSA encryption algorithm can be attacked:
attacks against
At 8:07 PM -0700 6/5/09, Greg Perry wrote:
>Greetings list members,
>
>I have published a unique factoring method related to Pollard's Rho that
>is published here:
>
>http://blog.liveammo.com/2009/06/factoring-fun/
>
>Any feedback would be appreciated.
Is there any practical value to this work? Th
