Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Topic: Fermat factorization running time
Replies: 2   Last Post: Dec 27, 2012 9:08 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 419
Registered: 10/7/06
Re: Fermat factorization running time
Posted: Dec 27, 2012 7:42 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Dec 23, 6:22 pm, kadhir thillai <yourskad...@gmail.com> wrote:
> Hi,
> The logic that odd composite with least difference will be factored easily and large difference would factored hardly is wrong. Please follow the link to know more.http://kadinumberprops.blogspot.in

I'll take a large random prime number p. Then I'll take a large prime
number q randomly chosen randomly between 20p and 50p. Then I give you
the product p*q. How are you going to factor this?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.